Transformation techniques for context-sensitive rewrite systems
From MaRDI portal
Publication:5692154
Recommendations
Cited in
(28)- Proving termination properties with \textsc{mu-term}
- Relaxing monotonicity for innermost termination
- Proving operational termination of membership equational programs
- A Transformational Approach to Prove Outermost Termination Automatically
- Proving termination of context-sensitive rewriting with MU-TERM
- scientific article; zbMATH DE number 1405631 (Why is no real title available?)
- Automating the dependency pair method
- Lazy productivity via termination
- Loops under Strategies
- Context rewriting
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Polynomials over the reals in proofs of termination : from theory to practice
- 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
- Context-sensitive dependency pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- Transforming Outermost into Context-Sensitive Rewriting
- From Outermost Termination to Innermost Termination
- Context-sensitive rewriting strategies
- scientific article; zbMATH DE number 1948501 (Why is no real title available?)
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)
