Generalized innermost rewriting

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose two generalizations of innermost rewriting for which we prove that termination of innermost rewriting is equivalent to termination of generalized innermost rewriting. As a consequence, by rewriting in an arbitrary TRS certain non-innermost steps may be allowed by which the termination behavior and efficiency is often much better, but never worse than by only doing innermost rewriting. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Van De Pol, J., & Zantema, H. (2005). Generalized innermost rewriting. In Lecture Notes in Computer Science (Vol. 3467, pp. 2–16). Springer Verlag. https://doi.org/10.1007/978-3-540-32033-3_2

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