A sequential reduction strategy

Theoretical Computer Science

Volumn 165, Issue 1, 1996, Pages 75-95

  Antoy, Sergio ^a   Middeldorp, Aart ^b  

^a Portland State University   (United States)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; THEOREM PROVING;

NON TERMINATION; NORMALIZATION; ORTHOGONAL TERM REWRITING SYSTEM; OUTERMOST FAIR LIKE STRATEGY; REDEX; SEQUENTIAL REDUCTION STRATEGY;

PROGRAMMING THEORY;

EID: 0030246769     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00041-2     Document Type: Article

References (14)

1. J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, J. Comput. System Sci. 32 (1986) 323-362.
2. H. Comon, Sequentially, second order monadic logic and tree automata, in: Proc. 10th IEEE Symp. on Logic in Computer Science, San Diego (1995) 508-517.
3. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen ed., Handbook of Theoretical Computer Science, Vol. B (North-Holland, Amsterdam, 1990) 243-320.
4. G. Huet and J.-J. Levy, Computations in orthogonal rewriting systems, I and II, in: J.-L. Lassez and G. Plotkin, eds., Computational Logic, Essays in Honor of Alan Robinson (MIT Press, NewYork, 1991) 396-443. Previous version: Call by need computations in non-ambiguous linear term rewriting systems, Report 359, INRIA, 1979.
5. J.R. Kennaway, Sequential evaluation strategies for parallel-or and related reduction systems, Ann. Pure Appl. Logic 43 (1989) 31-56.
6. J.W. Klop, Combinatory reduction systems, Ph.D. Thesis, Mathematical Centre Tracts, Vol. 127, Centre for Mathematics and Computer Science, Amsterdam, 1980.
7. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay and T. Maibaum, eds., Handbook of Logic in Computer Science, Vol. II (Oxford Univ. Press, Oxford 1992) 1-116.
8. M.J. O'Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science, Vol. 58, 1977.
9. V. van Oostrom, Confluence for abstract and higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1994.
10. M. Oyamaguchi, NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems, SIAM J. Comput. 22 (1993) 114-135.
11. S. Porat and N. Francez, Fairness in term rewriting systems, Methods Logic Comput. Sci. 1 (1994) 141-181.
12. F. van Raamsdonk, On normalising strategies, in: Proc. 2nd Internat. Workshop on Higher-Order Algebra, Logic and Term Rewriting, Paderborn, Lecture Notes in Computer Science, 1995, to appear.
13. R.C. Sekar and I.V. Ramakrishnan, Programming in equational logic: beyond strong sequentiality, Inform. Comput. 104 (1993) 78-109.
14. Y. Toyama, Strong Sequentiality of left-linear overlapping term rewriting systems, in: Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz (1992) 274-284.