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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambr. Univ. Pr., Cambridge (1998)
Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term rewriting systems with rule priorities. Theoretical Computer Science 67, 283–301 (1989)
Fokkink, W.J., Kamperman, J.F.T., Walters, H.R.: Lazy rewriting and eager machinery. ACM Transactions on Programming Languages and Systems 22(1), 45–86 (2000)
Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Goguen, J., Malcolm, G. (eds.) Software Engineering with OBJ: algebraic specification in action, Kluwer, Dordrecht (2000)
Gramlich, B.: Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae 24, 3–23 (1995)
Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178, 294–343 (2002)
Nakamura, M., Ogata, K.: The evaluation strategy for head normal form with and without on-demand flags. In: Futatsugi, K. (ed.) The 3rd Int. W. on Rewriting / Logic and its Applications (WRLA 2000). Electronic Notes in Theoretical Computer Science, vol. 36, Elsevier, Amsterdam (2001)
O’Donnell, M.J.: Computing in Systems Described by Equations. LNCS, vol. 58. Springer, Heidelberg (1977)
Toyama, Y.: Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters 25, 141–143 (1987)
van de Pol, J.C.: Just-in-time: on strategy annotations. In Int. Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001). Electronic Notes in Theoretical Computer Science, vol. 57 (2001)
van de Pol, J.C.: JITty: a rewriter with strategy annotations. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 367–370. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van de Pol, J., Zantema, H. (2005). Generalized Innermost Rewriting. In: Giesl, J. (eds) Term Rewriting and Applications. RTA 2005. Lecture Notes in Computer Science, vol 3467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32033-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-32033-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25596-3
Online ISBN: 978-3-540-32033-3
eBook Packages: Computer ScienceComputer Science (R0)