Relaxing monotonicity for innermost termination

DOI10.1016/J.IPL.2004.10.005MaRDI QIDQ835006zbMATHOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 1332639 (Why is no real title available?)
• scientific article; zbMATH DE number 1948501 (Why is no real title available?)
• scientific article; zbMATH DE number 2043534 (Why is no real title available?)
• scientific article; zbMATH DE number 1487842 (Why is no real title available?)
• scientific article; zbMATH DE number 2090310 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Improving dependency pairs
• Modular termination proofs for rewriting using dependency pairs
• Termination of context-sensitive rewriting
• Termination of rewriting with strategy annotations
• Termination of term rewriting using dependency pairs
• Transformation techniques for context-sensitive rewrite systems

Cited in

(5)

• Context-sensitive dependency pairs
• Using context-sensitive rewriting for proving innermost termination of rewriting
• Proving termination of context-sensitive rewriting by transformation
• Polynomials over the reals in proofs of termination : from theory to practice
• Applications and extensions of context-sensitive rewriting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835006)