Term Rewriting Systems 2010-2011

Course

The course term rewriting systems is taught in fall 2010 in the weeks 44-50.
There are weekly lectrures and exercise classes. The lecturer is Jörg Endrullis.

Course schedule

	Lectures	Exercise classes
week 44 - 50	Monday 15:30 - 17:15 in WN-M607 Wednesday 13:30 - 15:15 in WN-S655	to be announced

Exam:

The exam will be on December 17th at 1:00 in room C648.

Training exam for the preparation: here.

Exam Results:

Student Number	Result
2129183	9.5
2035464	9.0
2128071	8.5
1397257	6.0

Lecture Slides:

The slides will be put online after each lecture:

Lectures 1 and 2: Introduction and Abstract Rewriting
Lecture 3: Term Rewriting
Lecture 4: Combinatory Logic
Lectures 5 and 6: Termination
Lectures 7: Matching and Unification
Lectures 8: Equational Reasoning and Completion
Lectures 9: Confluence
Lectures 10: Modularity
Lectures 11: Strategies
Lectures 12: Decidability
Lectures 13: Infinitary Rewriting

Exercises: here

Material

Terese Lite [ps][pdf]
Infinitary Normalization [pdf]
Iterative lexicographic path orders [pdf]
Background lambda calculus:
J. Roger Hindley and Jonathan P. Seldin, Lambda Calculus and Combinators,
Cambridge University Press 2008

Last update December 22, 2008