Journal of Symbolic Computation
Term rewriting and all that
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Operational semantics of rewriting with the on-demand evaluation strategy
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of Context-Sensitive Rewriting by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Lazy Rewriting and Eager Machinery
RTA '95 Proceedings of the 6th 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
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
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 Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Lazy Rewriting Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
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)
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
New Evaluation Commands for Maude Within Full Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Context-sensitive dependency pairs
Information and Computation
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
Declarative languages such as OBJ, CafeOBJ, and Maude use syntactic annotations to introduce replacement restrictions aimed at improving termination or efficiency of computations. Unfortunately, there is a lack of formal techniques for proving such benefits. We show that context-sensitive rewriting and on-demand rewriting provide a suitable framework to address this problem. We provide methods to analyze termination of on-demand rewriting and apply them to analyze termination of OBJ, CafeOBJ, and Maude programs.