Schedule
|
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
Saturday |
9:00 – 10:30 |
1 |
4 |
7 |
excursions |
e4 |
12 |
10:30 – 11:00 |
break |
break |
11:00 – 12:30 |
2 |
5 |
e3 |
10 |
13 |
12:30 – 14:00 |
lunch |
lunch |
14:00 – 15:30 |
3 |
e2 |
8 |
11 |
e6 |
15:30 – 16:00 |
break |
break |
16:00 – 17:30 |
e1 |
6 |
9 |
e5 |
test |
|
Monday
Tuesday
-
lecture 4: term rewrite systems, undecidability, Post correspondence
problem
1-up
4-up
beamer
-
lecture 5: congruence closure, termination, polynomial interpretations
1-up
4-up
beamer
-
exercises
pdf
-
solutions
pdf
-
lecture 6: lexicographic path order, unification, critical pairs
1-up
4-up
beamer
Wednesday
-
lecture 7: completion, primality, first-order theory of rewriting
1-up
4-up
beamer
-
exercises
pdf
-
solutions
pdf
-
lecture 8: Knuth-Bendix order, normalization equivalence, abstract
completion
1-up
4-up
beamer
-
lecture 9: confluence, orthogonality, multi-step rewriting, critical pair
conditions
1-up
4-up
beamer
Friday
-
exercises
pdf
-
solutions
pdf
-
lecture 10: proof terms, strategies, normalization
1-up
4-up
beamer
-
lecture 11: optimal strategies, strategy annotations, simple
termination
1-up
4-up
beamer
-
exercises
pdf
-
solutions
pdf
Saturday
-
lecture 12: dependency pairs, Z property
1-up
4-up
beamer
-
lecture 13: argument filters, dependency graph, dependency pair processors,
subterm property
1-up
4-up
beamer
-
exercises
pdf
-
solutions
pdf
-
test
pdf
-
solutions
pdf