Transformation techniques for context-sensitive rewrite systems
From MaRDI portal
Publication:5692154
DOI10.1017/S0956796803004945zbMath1104.68056OpenAlexW2089309203WikidataQ29031754 ScholiaQ29031754MaRDI QIDQ5692154
Publication date: 27 September 2005
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796803004945
Related Items
Relaxing monotonicity for innermost termination, Proving termination of context-sensitive rewriting by transformation, Polynomials over the reals in proofs of termination : from theory to practice, Termination of Cycle Rewriting by Transformation and Matrix Interpretation, Unnamed Item, Usable Rules for Context-Sensitive Rewrite Systems, A Transformational Approach to Prove Outermost Termination Automatically, Automating the dependency pair method, Proving operational termination of membership equational programs, From Outermost Termination to Innermost Termination, Context-sensitive dependency pairs, Proving Termination Properties with mu-term, Applications and extensions of context-sensitive rewriting, Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting, Loops under Strategies, Lazy Rewriting and Context-Sensitive Rewriting, On-demand strategy annotations revisited: an improved on-demand evaluation strategy, Context-sensitive rewriting strategies, Improving the Context-sensitive Dependency Graph, Proving Termination of Context-Sensitive Rewriting with MU-TERM
Uses Software
