Normalisation in weakly orthogonal rewriting

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

Volumn 1631, Issue , 1999, Pages 60-74

  van Oostrom, Vincent ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INFINITARY; NORMALISATION; REWRITE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84957613635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_5     Document Type: Conference Paper

References (26)

1. AM96. Sergio Antoy and Aart Middeldorp. A sequential reduction strategy. Theoretical Computer Science, 165(1):75-95, 1996.
2. Bar84. H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, revised edition, 1984.
3. BKV98. Inge Bethke, Jan Willem Klop, and Roel de Vrijer. Descendants and origins in term rewriting. IR 458, Vrije Universiteit, Amsterdam, December 1998.
4. BN98. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, February 1998.
5. Bou85. G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J.C. Reynolds, editors, Algebraic Methods in Semantics, pages 169-236. Cambridge University Press, 1985.
6. Chu41. Alonzo Church. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, New Jersey, 1941. Second Printing 1951.
7. CR36. Alonzo Church and J.B. Rosser. Some properties of conversion. Transactions of the American Mathematical Society, 39:472-482, January to June 1936.
8. GK94. John Glauert and Zurab Khasidashvili. Relative normalization in orthogonal expression reduction systems. In CTRS'94, volume 968 of Lecture Notes in Computer Science, pages 144-165. Springer, 1994.
9. GLM92. Georges Gonthier, Jean-Jacques Lévy, and Paul-André Melliès. An abstract standardisation theorem. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science, pages 72-81, 1992.
10. Gra96. Bernhard Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Universität Kaiserslautern, 19. Januar 1996.
11. HL91. Gérard Huet and Jean-Jacques Lévy. Computations in orthogonal rewriting systems, I. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991.
12. Hue80. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, October 1980.
13. Klo80. J.W. Klop. Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit Utrecht, June 1980. Mathematical Centre Tracts 127.
14. Lév78. Jean-Jacques Lévy. Réductions correctes et optimales dans le λ-calcul. Thése de doctorat d'etat, Université Paris VII, 1978.
15. Mel97. Paul-André Melliès. Axiomatic rewriting theory III, a factorisation theorem in rewriting theory. In CTCS'97, volume 1290 of Lecture Notes in Computer Science, pages 49-68. Springer, 1997.
16. Mel98. Paul-André Melliès. Axiomatic rewriting theory IV, a stability theorem in rewriting theory. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science, pages 287-298, 1998.
17. Mid97. Aart Middeldorp. Call by need computations to root-stable form. In Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, pages 94-105, 1997.
18. Nip91. Tobias Nipkow. Higher-order critical pairs. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 342-349, 1991.
19. O'D77. M.J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer Verlag, 1977.
20. Oos94. Vincent van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, March 1994.
21. Oos97. Vincent van Oostrom. Finite family developments. In RTA'97, volume 1232 of Lecture Notes in Computer Science, pages 308-322. Springer, 1997.
22. Pey87. Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, 1987.
23. Raa96. Femke van Raamsdonk. Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, May 1996.
24. Raa97. Femke van Raamsdonk. Outermost-fair rewriting. In TLCA'97, volume 1210 of Lecture Notes in Computer Science, pages 284-299. Springer, 1997.
25. Ros35. J.B. Rosser. A mathematical logic without variables I. Annals of Mathematics, 36:127-150, 1935.
26. SR90. R.C. Sekar and I.V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science, pages 230-241, 1990.