Termination of Rewriting With Strategy Annotations

Authors:
Salvador Lucas
Affiliations:
-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 11
Cited 5

Termination of rewriting

Journal of Symbolic Computation
Operational semantics of rewriting with priorities

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Termination of Context-Sensitive Rewriting by Rewriting

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Implementation of Term Rewritings with the Evaluation Strategy

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
On Proving Termination by Innermost Termination

RTA '96 Proceedings of the 7th 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
Proving Innermost Normalisation Automatically

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Termination of on-demand rewriting and termination of OBJ programs

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods

Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving termination properties with MU-TERM

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A proof of weak termination providing the right way to terminate

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Termination of context-sensitive rewriting with built-in numbers and collection data structures

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Narrowing, abstraction and constraints for proving properties of reduction relations

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate termination of rewriting computations guided by strategy annotations. We show that proofs of termination can be obtained by proving(innermost) termination of context-sensitive rewriting( CSR). Hence, we investigate how to prove innermost termination of CSR usingexistingmetho ds for provingtermination of CSR.