Normalization without reducibility

Annals of Pure and Applied Logic

Volumn 107, Issue 1-3, 2001, Pages 121-130

  David, René ^a  

^a Institut Universitaire de France   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037687933     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00030-0     Document Type: Article

References (15)

1. Amadio R., Curien P.L. Domains and Lambda-Calculi. 1998;Cambridge University Press, Cambridge.
2. Barendregt H.P. The Lambda Calculus, its Syntax and Semantics. 1984;North-Holland, Amsterdam.
3. Barendregt H.P., Coppo M., Dezani-Ciancaglini M. A filter lambda model and the completeness of type assignment. J. Symbolic Logic. 48:1983;931-940.
4. Bucciarelli A., De Lorenzis S., Piperno A., Salvo I. Some Computational Properties of Intersection Types, Lecture Notes in Computer Science. 1999;Springer, Berlin.
5. Coppo M., Dezani M. A new type assignment for. λ -terms Arch. Math. Logic. 19:1978;139-156.
6. Coppo M., Dezani M., Venneri B. Functional characters of solvable terms. Z. Math. Log. Grund. Math. 27:1981;45-58.
7. David R. Une preuve simple de résultats classiques en. λ calcul C. R. Acad. Sci. Paris Sér. I. 1995;1401-1406.
8. Gallier J. Typing untyped. λ -terms, or reducibility strikes again Ann. Pure Appl. Logic. 91:1998;231-270.
9. G. Huet. Initiation au λ -calcul, Tech. Report, Université Paris 7, 1991.
10. J.L. Krivine, Lambda Calcul Types et Modèles, Masson (Collection ERI), Paris, 1990.
11. Leivant D. Typing and Computational Properties of Lambda Expressions. Theoret. Comput. Sci. 44:1986;51-68.
12. R. Loader, Notes on simply typed lambda calculus, Manuscript, 1998.
13. R. Matthes, Short proofs of normalization, Manuscript, 1999.
14. van Bakel S. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci. 102:1992;135-163.
15. van Bakel S. Intersection type disciplines in lambda calculus and applicative term rewriting systems, Ph.D. Thesis. 1993;Mathematisch Centrum, Amsterdam.