Skip to Main content Skip to Navigation
Conference papers

Diagrammatic Confluence and Completion

Jean-Pierre Jouannaud 1 Vincent van Oostrom 2 
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : We give a new elegant proof that decreasing diagrams imply confluence based on a proof reduction technique, which is then the basis of a novel completion method which proof-reduction relation transforms arbitrary proofs into rewrite proofs even in presence of non-terminating reductions. Unlike previous methods, no ordering of the set of terms is required, but can be used if available. Unlike ordered completion, rewrite proofs are closed under instantiation. Examples are presented, including Kleene's and Huet's classical examples showing that non-terminating local-confluent relations may not be confluent.
Document type :
Conference papers
Complete list of metadata
Contributor : Jean-Pierre Jouannaud Connect in order to contact the contributor
Submitted on : Thursday, November 26, 2009 - 8:30:52 AM
Last modification on : Friday, February 4, 2022 - 3:08:36 AM

Links full text




Jean-Pierre Jouannaud, Vincent van Oostrom. Diagrammatic Confluence and Completion. International Conference in Automata, Languages and Programming, Paul Spirakis, Jul 2009, Rhodes, Greece. ⟨10.1007/978-3-642-02930-1_18⟩. ⟨inria-00436070⟩



Record views