Abstract
Huet and Lévy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a decidable needed reduction strategy, they proposed the notion of strongly sequential approximation. Extending their seminal work, several better decidable approximations of left-linear term rewriting systems, for example, NV approximation, shallow approximation, growing approximation, etc., have been investigated in the literature. In all of these works, orthogonality is required to guarantee approximated decidable needed reductions are actually normalizing strategies. This paper extends these decidable normalizing strategies to left-linear overlapping term rewriting systems. The key idea is the balanced weak Church-Rosser property. We prove that approximated external reduction is a computable normalizing strategy for the class of left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for example, combinatory logic CL with the overlapping rules pred ·(succ ·x) →x and succ ·(pred ·x) →x, for which leftmost-outermost reduction is a computable normalizing strategy.
A part of this paper was published as preliminary version in [24].
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. Cambridge University Press, Cambridge (1998)
Barendregt, H.P.: The lambda calculus, its syntax and semantics. North-Holland, Amsterdam (1981)
Comon, H.: Sequentiality, Second Order Monadic Logic and Tree Automata. Information and Computation 157, 25–51 (2000)
Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Preliminary Version, http://www.grappa.univ-lille3.fr/tata/
Durand, I.: Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. Journal of Symbolic Computation 18, 319–352 (1994)
Durand, I., Middeldorp, A.: Decidable Call-by-Need Computations in Term Rewriting. Information and Computation 196, 95–126 (2005)
Hindley, J.R., Seldin, J.P.: Introduction to Combinators and λ-Calculus. Cambridge University Press, Cambridge (1986)
Huet, G., Lévy, J.J.: Computations in Orthogonal Term Rewriting Systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 396–443. MIT Press, Cambridge (1991)
Jacquemard, F.: Decidable Approximations of Term Rewriting Systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362–376. Springer, Heidelberg (1996)
Jouannaud, J.P., Sadfi, W.: Strong sequentiality of left-linear overlapping rewrite systems, in. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 235–246. Springer, Heidelberg (1995)
Klop, J.W.: Combinatory reduction systems, Dissertation, Univ. of Utrecht (1980)
Klop, J.W., Middeldorp, A.: Sequentiality in orthogonal term rewriting systems. J. Symbolic Comput. 12, 161–195 (1991)
Middeldorp, A.: Call by need computations to root-stable form. In: Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pp. 94–105 (1997)
Nagaya, T., Sakai, M., Toyama, Y.: Index reduction of overlapping strongly sequential systems. IEICE TRANS. INF. & SYST E-81D, 419–426 (1998)
Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Information and Computation 178, 499–514 (2002)
Newman, M.H.A.: On theories with a combinatorial definition of “equivalence”. Ann. Math. 43, 223–243 (1942)
O’Donnell, M.J. (ed.): Computing in Systems Described by Equations. LNCS, vol. 58. Springer, Heidelberg (1977)
Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)
van Oostrom, V., de Vrijer, R.: Strategies, In Terese, Term Rewriting Systems, pp. 475–547. Cambridge University Press, Cambridge (2003)
van Oostrom, V.: Delimiting diagrams. In: Proceedings of 5th International Workshop on Reduction Strategies in Rewriting and Programming, pp. 17–24 (2005)
Oyamaguchi, M.: NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term Rewriting Systems. SIAM Journal on Computation 22(1), 112–135 (1993)
Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
Toyama, Y., Smetsers, S., Eeklen, M., Plasmeijer, R.: The functional strategy and transitive term rewriting systems. In: Sleep, M.R., et al (eds.) Term Graph Rewriting, pp. 61–75. Wiley, Chichester (1993)
Toyama, Y.: Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems. In: Proceedings of the 7th IEEE Symposium on Logic in Computer Science, pp. 274–284 (1992)
Vuillemin, J.: Correct and optimal implementations of recursion in a simple programming language. J. Comput. System Sci. 9, 332–354 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Toyama, Y. (2005). Reduction Strategies for Left-Linear Term Rewriting Systems. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds) Processes, Terms and Cycles: Steps on the Road to Infinity. Lecture Notes in Computer Science, vol 3838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601548_13
Download citation
DOI: https://doi.org/10.1007/11601548_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30911-6
Online ISBN: 978-3-540-32425-6
eBook Packages: Computer ScienceComputer Science (R0)