Transfinite rewriting semantics for term rewriting systems

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

Volumn 2051 LNCS, Issue , 2001, Pages 216-230

  Lucas, Salvador ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC STRUCTURES; NEW RESULTS; REWRITE SYSTEMS; REWRITING SEMANTICS; TERM REWRITING SYSTEMS; UNIFIED FRAMEWORK; FRAME-WORK;

SEMANTICS;

EID: 84888270547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_17     Document Type: Conference Paper

References (14)

1. M. Alpuente, S. Escobar, and S. Lucas. Redundancy Analyses in Term Rewriting. In Proc of WFLP'2000, pages 309-323, 2000.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 169-236, Cambridge University Press, Cambridge, 1985.
4. B. Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science 25:95-169, 1983.
5. B. Courcelle. Recursive Applicative Program Schemes. In Handbook of Theoretical Computer Science, pages 459-492, Elsevier, 1990.
6. N. Dershowitz, S. Kaplan, and D. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite. Theoretical Computer Science 83:71-96, 1991.
7. I. Durand and A. Middeldorp. Decidable Call by Need Computations in Term Rewriting (Extended Abstract). In Proc. of CADE'97, LNAI 1249:4-18, 1997.
8. M. Hanus and S. Lucas. An Evaluation Semantics for Narrowing-Based Functional Logic Languages. Journal of Functional and Logic Programming, to appear, 2001.
9. G. Huet and J.J. Lévy. Computations in orthogonal term rewriting systems. In Computational logic: essays in honour of J. Alan Robinson, pages 395-414 and 415-443. The MIT Press, Cambridge, MA, 1991.
10. F. Jacquemard. Decidable approximations to Term Rewriting Systems. In Proc. of RTA'96, LNCS 1103:362-376, 1996.
11. R. Kennaway, J.W. Klop, M.R. Sleep, and F.-J. de Vries. Transfinite reductions in Orthogonal Term Rewriting Systems. Information and Computation 119(1):18-38, 1995.
12. S. Lucas. Observable Semantics and Dynamic Analysis of Computational Processes. Technical Report LIX/RR/00/02, École Polytechnique, Palaiseau, France, 2000.
13. A. Middeldorp. Call by Need Computations to Root-Stable Form. In Proc. of POPL'97, pages 94-105, ACM Press, 1997.
14. A. Pitts. Operationally-Based Theories of Program Equivalence. In Semantics and Logics of Computation, pages 241-298, Cambridge University Press, 1997.