Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
From MaRDI portal
Publication:5941196
DOI10.1016/S0304-3975(99)00340-0zbMath0974.68080MaRDI QIDQ5941196
No author found.
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional linearization
- Fundamental properties of infinite trees
- An extension of Klop's counterexample to the Church-Rosser property to \(\lambda\)-calculus with other ordered pair combinators
- Conditional rewrite rules: Confluence and termination
- Unique normal forms for lambda calculus with surjective pairing
- Diagram techniques for confluence
- Confluence by decreasing diagrams
- Developing developments
- Unique normal form property of Higher-Order Rewriting Systems
- Proving termination with multiset orderings
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
- Theoretical Pearl Yet yet a counterexample for λ+SP
- Problems in rewriting III
- Unique normal forms for nonlinear term rewriting systems: Root overlaps
- Tree-Manipulating Systems and Church-Rosser Theorems
