LFU:online

Students who completed this module understand the concept of term rewrite systems as formal computation model, which
forms the basis of functional programming. They know important properties of term rewrite systems as well as methods to
establish these properties.

Abstract rewrite systems; equational logic; term rewrite systems and their properties; termination; confluence; completion;
strategies

Continuous assessment (based on regular written and/or oral contribution by participants).

Course examination according to § 7, statute section on "study-law regulations"

Course notes will be made available from the accompanying web site.

none