Term Rewriting Systems


Course Objective

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

Course Content

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

Teaching Methods

Lectures and exercise classes.

Method of Assessment

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

Target Audience

mCS, mPDCS, mAI, mMath

General Information

Course Code XM_400121
Credits 6 EC
Period P4
Course Level 600
Language of Tuition English
Faculty Faculty of Science
Course Coordinator drs. J. Endrullis
Examiner drs. J. Endrullis
Teaching Staff drs. J. Endrullis

Practical Information

You need to register for this course yourself

Last-minute registration is available for this course.

Teaching Methods Seminar, Lecture
Target audiences

This course is also available as: