On interreduction of semi-complete term rewriting systems

DOI10.1016/S0304-3975(00)00030-XzbMath0974.68079MaRDI QIDQ5941203

Bernhard Gramlich

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

confluence; termination; interreduction; right-normalization; semi-completeness; term rewriting; theory of computation

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

Related Items

Decidability of reachability for disjoint union of term rewriting systems, Unification of infinite sets of terms schematized by primal grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in a combination of arbitrary disjoint equational theories
• Programming in equational logic: Beyond strong sequentiality
• Unique normal forms for lambda calculus with surjective pairing
• Computing in systems described by equations
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2--4, 1999. Proceedings
• About the rewriting systems produced by the Knuth-Bendix completion algorithm
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• More problems in rewriting
• On the Church-Rosser property for the direct sum of term rewriting systems
• Tree-Manipulating Systems and Church-Rosser Theorems