MPRI, 6*4=24 hours, 3 credits [serveur pédagogique]
Place: ENS Paris-Saclay, room 1B10
Staff: Frédéric Blanqui (lectures) and Théo Vignon (exercises)
Rewriting theory is the study of relations and, in particular, relations on symbolic expressions (terms). Relations can for instance be used to model transition systems, operational semantics, computation rules, and decide equational theories. Term rewriting is based on the notion of pattern matching. Programming languages like OCaml and Haskell, or proof assistants like Agda or Coq use a restricted form of pattern matching. Programming languages like Maude and proof assistants like Lambdapi allow a more general form of pattern-matching. Two properties will be of particular interest for us: termination (there is no infinite sequence of rewrite steps) and confluence (the order of rewrite steps does not matter). This course aims at introducing the fundamentals of rewriting theory, and in particular term rewriting systems, and some basic termination and confluence results and techniques used in nowadays state-of-the-art termination and confluence automated provers.
Planning:
To go further, have a look at the International School on Rewriting.
Online termination, confluence or completion tools:
More tools are available on:
Related courses: Well quasi-orders for algorithms, Gilles Dowek's lecture on proofs in theories