2000 character limit reached
Confluence by Decreasing Diagrams -- Formalized
Published 1 Oct 2012 in cs.LO | (1210.1100v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
