Term Rewriting Systems

 
Vakcode:
XM_400121
Periode:
Periode 5
Credits:
6.0
Voertaal:
Engels
Faculteit:
Faculteit der Exacte Wetenschappen
Coördinator:
drs. J. Endrullis
Examinator:
drs. J. Endrullis
Docenten:
drs. J. Endrullis
Lesmethode(n):
Hoorcollege, Werkcollege
Niveau:
400

Doel vak

Learning the fundamental notions of term rewriting and getting
acquainted with some more advanced topics in the field.

Inhoud vak

Term rewriting systems (TRSs) provide for a natural formalism for
specifying rules of computation and investigating their properties. TRSs
are of basic importance for functional programming and for the
implementation of abstract data types. Applications can also be found
in theorem proving, proof checking and logic programming. Some topics
that will be covered in the course are:
- abstract reduction systems
- term rewriting
- combinatory logic
- termination (rpo's, monotone algebras)
- confluence, critical pairs, orthogonality
- Knuth-Bendix completion
- strategies
- modularity
- decidability issues
- infinitary rewriting

Onderwijsvorm

Lectures and practice sessions

Toetsvorm

Written examination

Literatuur

Course notes will be provided

Doelgroep

mCS, mPDCS, mAI, mMath

© Copyright Vrije Universiteit Amsterdam
asnDCcreatorasvVUAmsterdam asnDCdateasv2017 asnstudyguideasvmodule asnDCidentifierasv50049475 asnDCtitleasvTermRewritingSystems asnperiodasv150 asnperiodasv asncreditsasv6p0 asnvoertaalasvE asnfacultyasv50000044 asnDCcoverageasvdrsJEndrullis