Confluence by Decreasing Diagrams -- Formalized
classification
💻 cs.LO
keywords
decreasingdiagramsabstractconfluenceconfluentconsideredconversiondiscusses
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.