ISR 2026 — 15th International School on Rewriting
Basic track
The course provides a comprehensive introduction to term rewriting. Term rewriting is a general model of computation which has been successfully applied in many areas of computer science. Here one can think of the analysis and implementation of algebraic specifications of abstract data types, the foundations of functional (logic) programming, automated theorem proving, and code optimization in compilers, to name just a few.
Topics to be discussed will include (but are not limited to): abstract rewriting systems, term rewriting systems, equational reasoning, termination, confluence, completion, Newman's lemma, critical pairs, monotonic algebras, path ordering, and dependency pairs.
The course consists of 17 slots of 90 minutes (divided into both lectures and exercise sessions), plus one optional 90-minute slot for the final test (for students requiring an ECTS certificate).
Lecturers
Track schedule (see the program for the overall program outline)
| Sunday | Monday | Tuesday | Wednesday | Thursday | |
|---|---|---|---|---|---|
| 9:00–10:30 | 1 | 5 | 9 | 11 | 15 |
| 10:30–11:00 | break | ||||
| 11:00–12:30 | 2 | 6 | 10 | 12 | 16 |
| 12:30–13:30 | break | ex cur sion |
break | ||
| 13:30–15:00 | 3 | 7 | 13 | 17 | |
| 15:00–15:30 | break | break | |||
| 15:30–17:00 | 4 | 8 | 14 | test | |
| 17:00–18:00 | dinner | dinner | |||