Students attending the course should acquire a deeper understanding in this area as well as get an impression of the importance of these theoretical foundations for applications in programming, as well as in specifying and verifying programs.

This advanced course focuses on and deepens various aspccts of the area "Computational Equational Logic". Topics to be dealt with include e.g. extended notions of term rewriting, reduction and computation strategies, modularity, rule-based programming, equational theorem proving, and semantics of equational / functional / functional-logic programs.

Specialization Options and Perspectives: The course also offers a good basis for various possibilities of deepening studies in
the field of Computational (Equational) Logic. This concerns students' projects in the context of the course Project in Computational Logic (185.302, PR, 2011S , 8.0h) within the European Masters Program in Computational Logic as well as of other Practical Courses, Seminars and Master Theses including potential topics for work on
Ph.D. projects within some Ph.D. studies (cf. also here).

For up-to-date information on the course, especially about dates, times and rooms, please always consult its homepage.

The course is intended as a continuation and deepening of "Term Rewriting Systems". However, it can also be attended (with some additional effort) without the latter course, since the basic foundations of rewriting and equational reasoning are repeated in concise form in the beginning.