A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
From MaRDI portal
Publication:1854476
DOI10.1006/INCO.2001.2945zbMATH Open1005.68088OpenAlexW1992603771MaRDI QIDQ1854476FDOQ1854476
Authors: Benedetto Intrigila, Ivano Salvo, Stefano Sorgi
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2001.2945
Recommendations
- scientific article; zbMATH DE number 3934390
- scientific article; zbMATH DE number 6109844
- A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
- Weak Convergence and Uniform Normalization in Infinitary Rewriting
- Infinitary term rewriting for weakly orthogonal systems: properties and counterexamples
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- On theories with a combinatorial definition of 'equivalence'
- Title not available (Why is that?)
- Fibonacci representations and finite automata
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- An abstract Church-Rosser theorem. II: Applications
This page was built for publication: A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854476)