Abstract
We design a normalizing strategy for orthogonal term rewriting systems (OTRSs), which is a generalization of the call-by-need strategy of Huet-Lévy [4]. The redexes contracted in our strategy are essential in the sense that they have “descendants” under any reduction of a given term. There is an essential redex in any term not in normal form. We further show that contraction of the innermost essential redexes gives an optimal reduction to normal form, if it exists. We classify OTRSs depending on possible kinds of redex creation as non-creating, persistent, inside-creating, non-left-absorbing, etc. All these classes are decidable. TRSs in these classes are sequential, but they do not need to be strongly sequential. For non-creating and persistent OTRSs, we show that our optimal strategy is efficient as well.
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
Berry G., Lévy J.-J. Minimal and optimal computations of recursive programs. JACM 26, 1979, p.148–175.
Courcelle B. Recursive Applicative Program Schemes. In: J.van Leeuwen ed. Hand-book of Theoretical Computer Science, Chapter 9, vol.B, 1990, p. 459–492.
Dershowitz N., Jouannaud J.-P. Rewrite Systems. In: J.van Leeuwen ed. Handbook of Theoretical Computer Science, Chapter 6, vol.B, 1990, p. 243–320.
Huet G., Lévy J.-J. Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, ed. by J.-L. Lassez and G. Plotkin, MIT Press, 1991. (First appeared in 1979, as IRIA Laboria report number 359).
Kennaway J.R. Sequential evaluation strategy for parallel-or and related reduction systems. Annals of Pure and Applied Logic 43, 1989, p.31–56.
Kennaway J.R., Sleep M.R. Neededness is hypernormalizing in regular combinatory reduction systems. Preprint, School of Information Systems, University of East Anglia, Norwich, 1989.
Kesner D. Free sequentiality in orthogonal order-sorted rewriting systems with constructors, in Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607, 1992.
Khasidashvili Z. Minimal Normalizing Strategy for Orthogonal and Persistent Term Rewriting Systems (short version). Proceedings of I.Vekua Institute of Applied Mathematics of Tbilisi State University, vol.36, 1990. p.189–199.
Klop J.W. Term Rewriting Systems: a tutorial. Bulletin of the EATCS 32, 1987, p. 143–182.
Klop J.W. Term Rewriting Systems. In: S.Abramsky, D.Gabby, and T.Maibaum eds. Handbook of Logic in Computer Science, vol. II, Oxford University Press, 1992.
Klop J.W., Middeldorp A. Sequentiality in orthogonal term rewriting systems. Report CS-R8932, CWI Amsterdam, 1989.
Lévy J.-J. Optimal Reduction in the Lambda-Calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley editors, Academic Press, 1980.
Maranget L. “La stratégie paresseuse”, These de l'Université' de PARIS VII, 1992.
O'Donnell M.J. Computing in systems described by equations. Springer LNCS 58, 1977.
Oyamaguchi M. Sufficient Sequentiality: A decidability Condition for call-by-need computations in term rewriting systems, Report, Mie University, 1987.
Pkhakadze Sh. Some problems of the Notation Theory (in Russian). Proceedings of I.Vekua Institute of Applied Mathematics, Tbilisi 1977.
Van Raamsdonk F. A simple proof of confluence for weakly orthogonal combinatory reduction systems. Report CS-R9234, CWI Amsterdam, 1992.
Thatte S. A refinement of strong sequentiality for term rewriting with constructors. Information and computation 72, 1987, p.46–65.
Toyama Y. Strong sequentiality of left-linear overlapping term rewriting systems. LICS, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khasidashvili, Z. (1993). Optimal normalization in orthogonal term rewriting systems. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive