Diagram techniques for confluence
From MaRDI portal
Publication:1271472
DOI10.1006/inco.1997.2683zbMath0919.68077OpenAlexW2049077134MaRDI QIDQ1271472
Vincent van Oostrom, Marc Bezem, Jan Willem Klop
Publication date: 10 November 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1282
Related Items (7)
New up-to techniques for weak bisimulation ⋮ Braids via term rewriting ⋮ Confluence by Decreasing Diagrams ⋮ Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem ⋮ Decreasing Diagrams and Relative Termination ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ De Bruijn's weak diamond property revisited
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Confluence by decreasing diagrams
- On theories with a combinatorial definition of 'equivalence'
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Diagram techniques for confluence
