Decreasing Diagrams

Harald Zankl 🌐

November 1, 2013

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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)


Theories of Decreasing-Diagrams