Confluence without termination via parallel critical pairs

DOI10.1007/3-540-61064-2_39OpenAlexW1591581638MaRDI QIDQ5878911

Bernhard Gramlich

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_39

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (9)

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent ⋮ Confluence of terminating conditional rewrite systems revisited ⋮ Developing developments ⋮ Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Unnamed Item ⋮ Shallow confluence of conditional term rewriting systems ⋮ Labelings for decreasing diagrams ⋮ Confluence and commutation for nominal rewriting systems with atom-variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence by decreasing diagrams
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Confluence without termination via parallel critical pairs