Compositional characterisations of λ-terms using intersection types

Theoretical Computer Science

Volumn 340, Issue 3, 2005, Pages 459-495

  Dezani Ciancaglini, M ^a   Honsell, F ^b   Motohama, Y ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

calculus; Intersection types; Normalisation properties; Set theoretical semantics of types

Indexed keywords

EVALUATION; SEMANTICS; SET THEORY; THEOREM PROVING;

Λ-CALCULUS; INTERSECTION TYPES; NORMALIZATION PROPERTIES; SET-THEORETICAL SEMANTICS OF TYPES;

COMPUTER SCIENCE;

EID: 23844506929     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.011     Document Type: Conference Paper

References (27)

1. S. Abramsky Domain theory in logical form Ann. Pure Appl. Logic 51 1-2 1991 1 77
2. S. Abramsky, and C.-H.L. Ong Full abstraction in the lazy lambda calculus Inform. and Comput. 105 2 1993 159 267
3. R.M. Amadio, and P.-L. Curien Domains and Lambda-Calculi 1998 Cambridge University Press Cambridge
4. S. van Bakel Complete restrictions of the intersection type discipline Theoret. Comput. Sci. 102 1 1992 135 163
5. H.P. Barendregt The Lambda Calculus: its Syntax and Semantics revised ed. 1984 North-Holland Amsterdam
6. H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini A filter lambda model and the completeness of type assignment J. Symbolic Logic 48 4 1983 931 940
7. H.P. Barendregt, et al., Typed λ -calculus and Applications, North-Holland, Amsterdam, to appear.
8. C. Berline From computation to foundations via functions and application: the λ -calculus and its webbed models Theoret. Comput. Sci. 249 2000 81 161
9. C. Böhm, M. Dezani-Ciancaglini, λ -terms as total or partial functions on normal forms, in: C. Böhm (Ed.), λ -calculus and Computer Science Theory, Lecture Notes in Computer Science, Vol. 37, Springer, Berlin, 1975, pp. 96-121.
10. M. Coppo, and M. Dezani-Ciancaglini An extension of the basic functionality theory for the λ -calculus Notre Dame J. Formal Logic 21 4 1980 685 693
11. M. Coppo, M. Dezani-Ciancaglini, and M. Zacchi Type theories, normal forms, and D ∞ -lambda-models Inform. and Comput. 72 2 1987 85 116
12. M. Coppo, F. Honsell, M. Dezani-Ciancaglini, and G. Longo Extended type structures and filter lambda models G. Lolli G. Longo A. Marcja Logic Colloq. '82 1984 North-Holland Amsterdam 241 262
13. M. Dezani-Ciancaglini, S. Ghilezan, Two behavioural lambda models, in: H. Geuvers, F. Wiedijk (Eds.), Types for Proof and Programs, Lecture Notes in Computer Science, Vol. 2646, Springer, Berlin, 2003, pp. 127-147.
14. M. Dezani-Ciancaglini, F. Honsell, and F. Alessi A complete characterization of the complete intersection-type preorders ACM Trans. Comput. Logic 1 4 2003 120 147
15. M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama Compositional characterization of λ -terms using intersection types M. Nielsen B. Rovan Mathematical Foundations of Computer Science 2000, Lecture Notes in Computer Science Vol. 1893 2000 Springer Berlin 304 313
16. L. Egidi, F. Honsell, and S. Ronchi della Rocca Operational, denotational and logical descriptions: a case study Fund. Inform. 16 2 1992 149 169
17. S. Ghilezan Strong normalization and typability with intersection types Notre Dame J. Formal Logic 37 1 1996 44 52
18. F. Honsell, and M. Lenisa Semantical analysis of perpetual strategies in λ -calculus Theoret. Comput. Sci. 212 1-2 1999 183 209
19. F. Honsell, and S. Ronchi della Rocca An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus J. Comput. System Sci. 45 1 1992 49 75
20. J.-L. Krivine Lambda-calcul Types et Modéles 1990 Masson Paris (English translation: Lambda-calculus, types and models, Ellis Horwood, Crystal City, 1993)
21. D. Leivant Typing and computational properties of lambda expressions Theoret. Comput. Sci. 44 1 1986 51 68
22. J. Mitchell Foundations for Programming Languages 1996 MIT Press Boston
23. D. Park, The Y -combinator in Scott's λ -calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warick, 1976.
24. G.D. Plotkin Set-theoretical and other elementary models of the λ -calculus Theoret. Comput. Sci. 121 1-2 1993 351 409
25. G. Pottinger A type assignment for the strongly normalizable λ -terms J.R. Hindley J.P. Seldin To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism 1980 Academic Press London 561 577
26. D. Scott, Continuous lattices, in: F.W. Lawvere (Ed.), Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics, Vol. 274, Springer, Berlin, 1972, pp. 97-136.
27. P. Severi, Normalisation in Lambda calculus and its relation to type inference, Ph.D. Thesis, Eindhoven University of Technology, 1996.