Term Rewriting Systems
Term rewriting systems can be used to compute in structures that are defined by equations. They are thus an important tool in automated deduction, algebraic specification, and functional programming. The course introduces important properties such as termination and confluence in the framework of abstract reduction systems, gives a brief introduction into universal algebra, and then concentrates on confluence, termination, and completion of term rewriting systems.
Prerequisites: Basic notions from a course on discrete algebraic structures would be helpful.
The lecture takes place twice a week in room GRU 350: Tuesday 16:40-18:10 and Thursday 14:50-16:20 (observe: time for Thursday has changed).
The exercise group takes place on Wednesday 11:20-12:40 also in room GRU 350 and is held by Ulrike Sattler.
There is an extra exercise group on friday, May 23, 2003 in DS5 (14:50 - 16:20) in room 350 to compensate for the exercises we missed due to the academic day on May 7.
The exercises can be downloaded in Postscript format (the exercises for next week will be available on friday at noon this week, possibly earlier):