Transformation techniques for context-sensitive rewrite systems

DOI10.1017/S0956796803004945zbMATH Open1104.68056DBLPjournals/jfp/GieslM04OpenAlexW2089309203WikidataQ29031754 ScholiaQ29031754MaRDI QIDQ5692154FDOQ5692154

Authors: Jürgen Giesl, Aart Middeldorp 

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

Recommendations

• Termination of context-sensitive rewriting
• scientific article; zbMATH DE number 1948501
• Proving termination of context-sensitive rewriting by transformation
• Applications and extensions of context-sensitive rewriting
• scientific article; zbMATH DE number 2102742

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (28)

• Relaxing monotonicity for innermost termination
• A Transformational Approach to Prove Outermost Termination Automatically
• Proving operational termination of membership equational programs
• Title not available (Why is that?)
• Proving termination of context-sensitive rewriting with MU-TERM
• Automating the dependency pair method
• Loops under Strategies
• Lazy productivity via termination
• Context rewriting
• Polynomials over the reals in proofs of termination : from theory to practice
• On-demand strategy annotations revisited: an improved on-demand evaluation strategy
• Proving termination of context-sensitive rewriting by transformation
• Termination of cycle rewriting by transformation and matrix interpretation
• Applications and extensions of context-sensitive rewriting
• A class of rewriting rules and reverse transformation for rule-based equivalent transformation
• Confluence of prefix-constrained rewrite systems
• Correctness of Context-Moving Transformations for Term Rewriting Systems
• Improving the context-sensitive dependency graph
• Lazy rewriting and context-sensitive rewriting
• Termination of lazy rewriting revisited
• Using context-sensitive rewriting for proving innermost termination of rewriting
• Usable Rules for Context-Sensitive Rewrite Systems
• Context-sensitive dependency pairs
• Transforming Outermost into Context-Sensitive Rewriting
• From Outermost Termination to Innermost Termination
• Context-sensitive rewriting strategies
• Title not available (Why is that?)
• Proving termination properties with \textsc{mu-term}

Uses Software

• OBJ3
• CafeOBJ

This page was built for publication: Transformation techniques for context-sensitive rewrite systems

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