Lecturers and topics

Basics:

• Introduction to Term Rewriting:
  • Motivation and abstract reduction systems
  • Equational problems
  • Termination
  • Confluence
  • Completion
  by Franz Baader, Dresden University, Germany
• Termination of Term Rewriting and Applications by Jürgen Giesl, Aachen University, Germany
• Compilation and Implementations by Pierre-Etienne Moreau, INRIA & LORIA, France
• Higher Order Rewrite Systems by Femke van Raamsdonk, CWI and Free University Amsterdam, Netherlands

Applications:

• A Formalism of Objects by Hassan Aït-Kaci, Ilog Vancouver, Canada
• Program Analysis and Proofs by Thomas Genet, Université de Rennes I & IRISA, France
• Theorem Proving by Christopher Lynch, Clarkson University, USA
• Rule based Security by Michaël Rusinowitch, INRIA & LORIA, France

Advanced topics:

• Normalisation Proofs by Dan Dougherty, Worcester Polytechnic Institute, USA
• Deduction Modulo by Gilles Dowek, Ecole Polytechnique & INRIA, France
• Tree Automaton by Denis Lugiez, Université de Provence, France
• Term-Graph Rewriting by Rachid Echahed, CNRS & LIG, France
• Nominal Techniques by Christian Urban, TU Munich, Germany