Relaxing monotonicity for innermost termination

DOI10.1016/J.IPL.2004.10.005zbMath1173.68543OpenAlexW2082986930MaRDI QIDQ835006

Mirtha-Lina Fernández

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.005

zbMATH Keywords

term rewritingprogram correctnessinnermost termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Context-sensitive dependency pairs ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

Cites Work

• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Termination of Rewriting with Strategy Annotations
• Termination of context-sensitive rewriting
• Foundations of Software Science and Computation Structures
• Transformation techniques for context-sensitive rewrite systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relaxing monotonicity for innermost termination