Decreasing Diagrams

Harald Zankl

1 November 2013


This theory contains a formalization of decreasing diagrams showing that any locally decreasing abstract rewrite system is confluent. We consider the valley (van Oostrom, TCS 1994) and the conversion version (van Oostrom, RTA 2008) and closely follow the original proofs. As an application we prove Newman's lemma.
GNU Lesser General Public License (LGPL)

Depends On


Related Entries