Course ObjectiveLearning the fundamental notions of term rewriting and getting
acquainted with some more advanced topics in the field.
Course ContentTerm 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
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
- decidability issues
- infinitary rewriting
Teaching MethodsLectures and exercise classes.
Method of AssessmentAt the end of the course there is a written final exam. The final grade
is the grade of the final exam.
LiteratureCourse notes will be provided
Target AudiencemCS, mPDCS, mAI, mMath
|Language of Tuition||English|
|Faculty||Faculty of Science|
|Course Coordinator||drs. J. Endrullis|
|Examiner||drs. J. Endrullis|
drs. J. Endrullis
You need to register for this course yourself
Last-minute registration is available for this course.
|Teaching Methods||Seminar, Lecture|
This course is also available as: