Some results on the confluence property of combined term rewriting systems
From MaRDI portal
Publication:1337642
DOI10.1007/BF02945519zbMath0821.68072MaRDI QIDQ1337642
Publication date: 8 November 1994
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Cites Work
- Finite complete rewriting systems and the complexity of word problem
- Termination of rewriting
- Operational and Semantic Equivalence Between Recursive Programs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- Unnamed Item
- Unnamed Item
This page was built for publication: Some results on the confluence property of combined term rewriting systems
