Skip to main content
Conference Proceedings

Termination of rewriting with strategy annotations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2250 669-684
DOI: 10.1007/3-540-45653-8_46
34Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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 usingexistingmethods for provingtermination of CSR.

Author supplied keywords

Cite

CITATION STYLE

APA

Lucas, S. (2001). Termination of rewriting with strategy annotations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2250, pp. 669–684). Springer Verlag. https://doi.org/10.1007/3-540-45653-8_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free