Term Rewriting Systems

Dit vak wordt in het Engels aangeboden. Omschrijvingen kunnen daardoor mogelijk alleen in het Engels worden weergegeven.

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 (recursive path orders, monotone algebras)
- confluence, critical pairs, orthogonality
- Knuth-Bendix completion
- strategies
- modularity
- decidability issues
- infinitary rewriting


Lectures and exercise classes.


At the end of the course there is a written final exam. The final grade
is the grade of the final exam.


Course notes will be provided


mCS, mPDCS, mAI, mMath

Algemene informatie

Vakcode XM_400121
Studiepunten 6 EC
Periode P4
Vakniveau 600
Onderwijstaal Engels
Faculteit Faculteit der Bètawetenschappen
Vakcoördinator drs. J. Endrullis
Examinator drs. J. Endrullis
Docenten drs. J. Endrullis

Praktische informatie

Voor dit vak moet je zelf intekenen.

Voor dit vak kun je last-minute intekenen.

Werkvormen Werkcollege, Hoorcollege

Dit vak is ook toegankelijk als: