Abstract
In this paper we study decidable approximations to call by need computations to normal and root-stable forms in term rewriting. We obtain uniform decidability proofs by making use of elementary tree automata techniques. Surprisingly, by avoiding complicated concepts like index and sequentiality we are able to cover much larger classes of term rewriting systems.
The work reported in this paper was initiated in March 1995 when the second author was staying at the University of Bordeaux. The support of LaBRI and the hospitality of the “Programmation Symbolique” group headed by Robert Strandh are gratefully acknowledged.
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
H. Comon, Sequentiality, Second-Order Monadic Logic and Tree Automata, Proc. 10th LICS (1995) 508–517.
J.L. Coquidé and R. Gilleron, Proofs and Reachability Problem for Ground Rewrite Systems, Proc. 6th International Meeting of Young Computer Scientists, LNCS 464 (1990) 120–129.
M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison, Decidability of the Confluence of Finite Ground Term Rewriting Systems and of Other Related Term Rewriting Systems, IC 88 (1990) 187–201.
M. Dauchet and S. Tison, Decidability of Confluence for Ground Term Rewriting Systems, Proc. 1st FCT, LNCS 199 (1985) 80–89.
N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990) 243–320.
J. Doner, Tree Acceptors and Some of Their Applications, JCSS 4 (1970) 406–451.
F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
G. Huet and J.-J. Lévy, Computations in Orthogonal Rewriting Systems, I and II, in: Computational Logic, Essays in Honor of Alan Robinson, The MIT Press (1991) 396–443.
F. Jacquemard, Decidable Approximations of Term Rewriting Systems, Proc. 7th RTA, LNCS 1103 (1996) 362–376.
J.-P. Jouannaud and W. Sadfi, Strong Sequentiality of Left-Linear Overlapping Rewrite Systems, Proc. 4th CTRS, LNCS 968 (1995) 235–246.
J.R. Kennaway, A Conflict Between Call-by-Need Computation and Parallelism, Proc. 4th CTRS, LNCS 968 (1995) 247–261.
J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. 2, Oxford University Press (1992) 1–116.
J.W. Klop and A. Middeldorp, Sequentiality in Orthogonal Term Rewriting Systems, JSC 12 (1991) 161–195.
A. Middeldorp, Call by Need Computations to Root-Stable Form, Proc. 24th POPL (1997) 94–105.
T. Nagaya, M. Sakai, and Y. Toyama, NVNF-Sequentiality of Left-Linear Term Rewriting Systems, Proc. RIMS Workshop on Theory and Applications of Rewriting, RIMS Technical Report 918, University of Kyoto (1995) 109–117.
M. Oyamaguchi, NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term Rewriting Systems, SIAM J. on Comput. 22 (1993) 114–135.
J.W. Thatcher and J.B. Wright, Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic, MST 2 (1968) 57–81.
W. Thomas, Automata on Infinite Objects, in: Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990) 133–191.
Y. Toyama, Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems, Proc. 7th LICS (1992) 274–284.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand, I., Middeldorp, A. (1997). Decidable call by need computations in term rewriting (extended abstract). In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-63104-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63104-0
Online ISBN: 978-3-540-69140-2
eBook Packages: Springer Book Archive