Decidable call by need computations in term rewriting (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1249, Issue , 1997, Pages 4-18

  Durand, Irène ^a   Middeldorp, Aart ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; THEOREM PROVING;

CALL-BY-NEED; ELEMENTARY TREES; EXTENDED ABSTRACTS; SEQUENTIALITY; STABLE FORM; TERM REWRITING; TERM REWRITING SYSTEMS;

COMPUTABILITY AND DECIDABILITY;

EID: 84957089001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_2     Document Type: Conference Paper

References (19)

1. H. Comon, Sequentiality, Second-Order Monadic Logic and Tree Automata, Proc. 10th LICS (1995) 508-517.
2. 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.
3. M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison, Decidability of the Conñuence of Finite Ground Term Rewriting Systems and of Other Related Term Rewriting Systems, IC 88 (1990) 187-201.
4. M. Dauchet and S. Tison, Decidability of Conñuence for Ground Term Rewriting Systems, Proc. 1st FCT, LNCS 199 (1985) 80-89.
5. N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990) 243-320.
6. J. Doner, Tree Acceptors and Some of Their Applications, JCSS 4 (1970) 406-451.
7. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
8. G. Huet and J.-J. Levy, Computations in Orthogonal Rewriting Systems, I and II, in: Computational Logic, Essays in Honor of Alan Robinson, The MIT Press (1991) 396-443.
9. F. Jacquemard, Decidable Approximations of Term Rewriting Systems, Proc. 7th RTA, LNCS 1103 (1996) 362-376.
10. J.-P. Jouannaud and W. Sadfi, Strong Sequentiality of Left-Linear Overlapping Rewrite Systems, Proc. 4th CTRS, LNCS 968 (1995) 235-246.
11. J.R. Kennaway, A Conflict Between Call-by-Need Computation and Parallelism, Proc. 4th CTRS, LNCS 968 (1995) 247-261.
12. J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. 2, Oxford University Press (1992) 1-116.
13. J.W. Klop and A. Middeldorp, Sequentiality in Orthogonal Term Rewriting Systems, JSC 12 (1991) 161-195.
14. A. Middeldorp, Call by Need Computations to Root-Stable Form, Proc. 24th POPL (1997) 94-105.
15. 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.
16. M. Oyamaguchi, NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term Rewriting Systems, SIAM J. on Comput. 22 (1993) 114-135.
17. 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.
18. W. Thomas, Automata on Infinite Objects, in: Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990) 133-191.
19. Y. Toyama, Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems, Proc. 7th LICS (1992) 274-284.