Diagrammatic Confluence and Completion

DOI10.1007/978-3-642-02930-1_18MaRDI QIDQ3638097zbMATH OpenOpenAlexFDO

Authors Jean-Pierre Jouannaud, Vincent van Oostrom

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02930-1_18

zbMATH Keywords

completionconfluencedecreasing diagramsrewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Diagram techniques for confluence
• Confluence by Decreasing Diagrams
• Confluence by decreasing diagrams -- formalized
• Proof orders for decreasing diagrams
• Decreasing diagrams and relative termination

Cited in

(14)

• A criterion for proving noetherianity of a relation
• Diagram techniques for confluence
• From diagrammatic confluence to modularity
• Proof orders for decreasing diagrams
• Confluence by decreasing diagrams -- formalized
• Confluence by Decreasing Diagrams
• scientific article; zbMATH DE number 2043523 (Why is no real title available?)
• A geometric proof of confluence by decreasing diagrams
• Diagrammatic confluence for constraint handling rules
• Unifying notions of pasting diagrams
• Confluence: the unifying, expressive power of locality
• Decreasing diagrams and relative termination
• Sort-based confluence criteria for non-left-linear higher-order rewriting
• De Bruijn's weak diamond property revisited

This page was built for publication: Diagrammatic Confluence and Completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638097)