Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations

DOI10.1007/978-3-540-70590-1_26zbMath1145.68458OpenAlexW1506290338MaRDI QIDQ3522031

Yoshihito Toyama

Publication date: 28 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_26

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Argument Filterings and Usable Rules for Simply Typed Dependency Pairs

Cites Work

• Orderings for term-rewriting systems
• Simple termination of rewrite systems
• Proof-theoretic analysis of termination proofs
• Polymorphic higher-order recursive path orderings
• A termination ordering for higher order rewrite systems
• Computer Science Logic
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Rewriting Techniques and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item