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 E05:
Tuesday 16:40-18:10 and Thursday 16:40-18:10.
The exercise group will be held by Barbara Morawska. It meets on Wednesdays 11:10-12:40 in E05.
The exercises can be downloaded in Postscript format (the exercises for next week will be available on Friday at noon this week, possibly earlier):