2000 character limit reached
Confluence by Decreasing Diagrams -- Formalized (1210.1100v2)
Published 1 Oct 2012 in cs.LO
Abstract: This paper presents a formalization of decreasing diagrams in the theorem prover Isabelle. It discusses mechanical proofs showing that any locally decreasing abstract rewrite system is confluent. The valley and the conversion version of decreasing diagrams are considered.