Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Context-Sensitive Rewriting by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Termination of Context-Sensitive Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Recursive Path Orderings Can Be Context-Sensitive
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Relaxing monotonicity for innermost termination
Information Processing Letters
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Usable Rules for Context-Sensitive Rewrite Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Improving Context-Sensitive Dependency Pairs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Relaxing monotonicity for innermost termination
Information Processing Letters
Proving termination properties with MU-TERM
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
Context-sensitive rewriting is a restriction of term rewriting used to model evaluation strategies in functional programming and in programming languages like OBJ. For example, under certain conditions termination of an OBJ program is equivalent to innermost termination of the corresponding context-sensitive rewrite system [18]. To prove termination of context-sensitive rewriting, several methods have been proposed in the literature which transform context-sensitive rewrite systems into ordinary rewrite systems such that termination of the transformed ordinary system implies termination of the original context-sensitive system. Most of these transformations are not very satisfactory when it comes to proving innermost termination. We investigate the relationship between termination and innermost termination of context-sensitive rewriting and we examine the applicability of the different transformations for innermost termination proofs. Finally, we present a simple transformation which is both sound and complete for innermost termination.