Confluence by Decreasing Diagrams -- Formalized
Logic in Computer Science
2013-04-12 v2
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.
Keywords
Cite
@article{arxiv.1210.1100,
title = {Confluence by Decreasing Diagrams -- Formalized},
author = {Harald Zankl},
journal= {arXiv preprint arXiv:1210.1100},
year = {2013}
}
Comments
17 pages; valley and conversion version; RTA 2013