Rewrite systems with abstraction and β-rule: Types, approximants and normalization

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

Volumn 1058, Issue , 1996, Pages 387-403

  van Bakel, Steffen ^a   Barbanera, Franco ^b   Fernández, Maribel ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BETA-REDUCTION; DIFFERENT CLASS; FIRST-ORDER REWRITING; INTERSECTION TYPE ASSIGNMENT SYSTEMS; LAMBDA ABSTRACTION; NORMALIZATION THEOREM; RECURSIVE DEFINITIONS; REWRITE SYSTEMS;

ABSTRACTING;

EID: 57549112765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (27)

1. Ariola Z., R. Kennaway, J.W. Klop, R. Sleep and F-J. de Vries. Syntactic definitions of undefined: on defining the undefined. In Proceedings of TACS '94, volume 789 of LNCS, pages 543-554, 1994.
2. S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135-163, 1992.
3. S. van Bakel. Partial Intersection Type Assignment in Applicative Term Rewriting Systems. In Proceedings of TLCA '93, volume 664 of LNCS, pages 29-44, 1993.
4. S. van Bakel. Intersection Type Assignment Systems. Theoretical Computer Science, 151(2):385-435, 1995.
5. S. van Bakel and M. Fernández. Strong Normalization of Typeable Rewrite Systems. In Proceedings of HOA '93, volume 816 of LNCS, pages 20-39, 1994.
6. S. van Bakel and M. Fernández. (Head-)Normalization of Typeable Rewrite Systems. In Proceedings of RTA '95, volume 914 of LNCS, pages 279-293, 1995.
7. S. van Bakel and M. Fernández. Approximation and Normalization Results for Typeable Rewrite Systems. To appear in Proceedings of HOA '95, Paderborn, Germany, 1995.
8. F. Barbanera and M. Fernández. Combining first and higher order rewrite systems with type assignment systems. In Proceedings of TLCA '93, volume 664 of LNCS, pages 60-74, 1993.
9. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of Strong Normalization and Confluence in the λ-algebraic-cube. In Proceedings of LICS'94, 1994.
10. H. Barendregt. The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition, 1984.
11. H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48(4):931-940, 1983.
12. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of LICS'88, pages 82-90, 1988.
13. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 83(1):3-28, 1991.
14. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic confluence. Information and Computation, 82:3-28, 1992.
15. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 245-320. North-Holland, 1990.
16. D.J. Dougherty. Adding Algebraic Rewriting to the Untyped Lambda Calculus. In Proceedings of RTA '91, volume 488 of LNCS, pages 37-48. 1991.
17. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
18. M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF. Lecture Notes in Computer Science, volume 78, 1979.
19. G. Huet and J.J. Lévy. Computations in Orthogonal Rewriting Systems. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in Honour of Alan Robinson. MIT Press, 1991.
20. J.P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of LICS'91, pages 350-361, 1991.
21. J.W. Klop. Term Rewriting Systems: a tutorial. EATCS Bulletin, 32:143-182, 1987.
22. J.W. Klop. Term Rewriting Systems. In S. Abramsky, Dov. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1-116. Clarendon Press, 1992.
23. Mitsuhiro Okada. Strong normalizability for the combined system of the types lambda calculus and an arbitrary convergent term rewrite system. InProceedings of ISSAC 89, Portland, Oregon, 1989.
24. W.W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32(2):198-223, 1967.
25. S.R. Thatte. Full Abstraction and Limiting Completeness in Equational Languages. Theoretical Computer Science, 65:85-119, 1989.
26. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceedings of the conference on Functional Programming Languages and Computer Architecture, volume 201 of LNCS, pages 1-16, 1985.
27. ∞-models of the lambda-calculus. SIAM J. Comput., 5:488-521, 1976