Strongly sequential and inductively sequential term rewriting systems

Information Processing Letters

Volumn 67, Issue 1, 1998, Pages 1-8

  Hanus, Michael ^a   Lucas, Salvador ^b   Middeldorp, Aart ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^c UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Declarative programming; Definitional trees; Neededness; Programming languages; Strong sequentiality; Term rewriting

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; THEOREM PROVING; TREES (MATHEMATICS);

DECLARATIVE PROGRAMMING; HUET-LEVY THEORY; INDUCTIVELY SEQUENTIAL; STRONG SEQUENTIALITY; TERM REWRITING SYSTEMS (TRS);

DATA PROCESSING;

EID: 0032120062     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00016-7     Document Type: Article

References (11)

1. S. Antoy, Definitional trees, in: Proc. ALP'92, Lecture Notes in Computer Science, vol. 632, Springer, Berlin, 1992, pp. 143-157.
2. S. Antoy, Needed narrowing in Prolog (Extended abstract), in: Proc. PLILP'96, Lecture Notes in Computer Science, vol. 1140, Springer, Berlin, 1996, pp. 473-474.
3. S. Antoy, R. Echahed, M. Hanus, A needed narrowing strategy, in: Proc POPL'94, ACM Press, New York, 1994, pp. 268-279.
4. S. Antoy, R. Echahed, M. Hanus, Parallel evaluation strategies for functional logic languages, in: Proc. 14th Internat. Conf. on Logic Programming, ICLP'97, MIT Press, Cambridge, MA, 1997, pp. 138-152.
5. N. Dershowitz, J.P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 243-320.
6. I. Durand, Bounded, strongly sequential and forward branching term rewriting systems, J. Symbolic Comput. 18 (1994) 319-352.
7. G. Huet, J.J. Lévy, Computations in orthogonal term rewriting systems, I and II, in: Computational Logic: Essays in Honour of J. Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 396-443.
8. J.W. Klop, Term rewriting systems, in: Handbook of Logic in Computer Science, vol. 3, Oxford University Press, Oxford, 1992, pp. 1-116.
9. J.W. Klop, A. Middeldorp, Sequentiality in orthogonal term rewriting systems, J. Symbolic Comput. 12 (1991) 161-195.
10. M.J. O'Donnell, Equational Logic as a Programming Language, MIT Press, Cambridge, MA, 1985.
11. R. Strandh, Classes of equational programs that compile into efficient machine code, in: Proc. RTA'89, Lecture Notes in Computer Science, vol. 355, Springer, Berlin, 1989, pp. 449-461.