Relaxing monotonicity for innermost termination
From MaRDI portal
Publication:835006
DOI10.1016/J.IPL.2004.10.005zbMATH Open1173.68543OpenAlexW2082986930MaRDI QIDQ835006FDOQ835006
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
Cites Work
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination of context-sensitive rewriting
- Improving dependency pairs
- Termination of rewriting with strategy annotations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Transformation techniques for context-sensitive rewrite systems
Cited In (5)
- Polynomials over the reals in proofs of termination : from theory to practice
- Proving termination of context-sensitive rewriting by transformation
- Applications and extensions of context-sensitive rewriting
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Context-sensitive dependency pairs
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)
