- Encoding induction in correctness proofs of program
transformations as a termination problem (2012) - The diagram-
based method to prove correctness of program transformations
consists of computing complete set of (forking and commuting)
diagrams, acting on sequences of standard reductions and program
transformations. In many cases, the only missing step for
proving correctness of a program transformation is to show the
termination of the rearrangement of the sequences. Therefore we
encode complete sets of diagrams as term rewriting systems and
use an automated tool to show termination, which provides a
further step in the automation of the inductive step in
correctness proofs. - Computing overlappings by unification in
the deterministic lambda calculus LR with letrec, case,
constructors, seq and variable chains (2011) - Correctness of
program transformations in extended lambda calculi with a
contextual semantics is usually based on reasoning about the
operational semantics which is a rewrite semantics. A su