A local termination property for term rewriting systems

DOI10.1007/3-540-51081-8_111zbMath1503.68129OpenAlexW1919615793MaRDI QIDQ5055724

Dana May Latch, Ron Sigal

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51081-8_111

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Cites Work

• Orderings for term-rewriting systems
• Proving termination with multiset orderings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Can programming be liberated from the von Neumann style?
• Subrecursive Programming Languages, Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A local termination property for term rewriting systems