Intersection types and lambda models

Theoretical Computer Science

Volumn 355, Issue 2, 2006, Pages 108-126

  Alessi, Fabio ^a   Barbanera, Franco ^b   Dezani Ciancaglini, Mariangiola ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF CATANIA   (Italy)

^c UNIVERSITY OF TURIN   (Italy)

Author keywords

and reduction expansion; calculus; models; Intersection types

Indexed keywords

CODES (STANDARDS); MATHEMATICAL MODELS; SEMANTICS;

Β- AND Η-REDUCTION/EXPANSION; Λ-CALCULUS; Λ-MODELS; INTERSECTION TYPES;

DIFFERENTIATION (CALCULUS);

EID: 33644919723     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.004     Document Type: Article

References (31)

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. F. Alessi, F. Barbanera, and M. Dezani-Ciancaglini Intersection types and computational rules R. de Queiroz E. Pimentel L. Figueiredo WoLLIC'03, ENTCS vol. 84 2003 Elsevier Amsterdam
4. F. Alessi, F. Barbanera, and M. Dezani-Ciancaglini Tailoring filter models S. Berardi M. Coppo F. Damiani TYPES'03, Lecture Notes in Computer Science vol. 3085 2004 Springer Berlin 17 33
5. F. Alessi, M. Dezani-Ciancaglini, and F. Honsell Filter models and easy terms A. Restivo S. Ronchi Della Rocca L. Roversi ICTCS'01, Lecture Notes in Computer Science vol. 2202 2001 Springer Berlin 17 37
6. F. Alessi, M. Dezani-Ciancaglini, and S. Lusin Intersection types and domain operators Theoret. Comput. Sci. 316 1-3 2004 25 47
7. F. Alessi, and S. Lusin Simple easy terms S. van Bakel ITRS'02, ENTCS Vol. 70 2002 Elsevier Amsterdam
8. H.P. Barendregt The Lambda Calculus: Its Syntax and Semantics revised ed. 1984 North-Holland Amsterdam
9. 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
10. M. Coppo, M. Dezani-Ciancaglini, and B. Venneri Functional characters of solvable terms Z. Math. Logik Grundlag. Math. 27 1 1981 45 58
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. H. Curry, and R. Feys Combinatory Logic, Studies in Logic and the Foundations of Mathematics Vol. I 1958 North-Holland Amsterdam
14. M. Dezani-Ciancaglini, and S. Ghilezan Two behavioural lambda models H. Geuvers F. Wiedijk TYPES'02, Lecture Notes in Computer Science vol. 2646 2003 Springer Berlin 127 147
15. M. Dezani-Ciancaglini, S. Ghilezan, and S. Likavec Behavioural inverse limit models Theoret. Comput. Sci. 316 1-3 2004 49 74
16. M. Dezani-Ciancaglini, F. Honsell, and F. Alessi A complete characterization of complete intersection-type preorders ACM TOCL 4 1 2003 120 147
17. M. Dezani-Ciancaglini, F. Honsell, Y. Motohama, Compositional characterization of λ -terms using intersection types, Theoret. Comput. Sci. 340 (3) (2005) 459-495.
18. L. Egidi, F. Honsell, and S. Ronchi Della Rocca Operational, denotational and logical descriptions: a case study Fund. Inform. 16 2 1992 149 169
19. E. Engeler Algebras and combinators Algebra Universalis 13 3 1981 389 392
20. G. Gierz, K. Hoffmann, K. Keimel, J. Mislove, and D. Scott A Compendium of Continuous Lattices 1980 Springer Berlin
21. R. Hindley, and G. Longo Lambda-calculus models and extensionality Z. Math. Logik Grundlag. Math. 26 4 1980 289 310
22. F. Honsell, and M. Lenisa Some results on the full abstraction problem for restricted lambda calculi A.M. Borzyszkowski S. Sokolowski MFCS'93, Lecture Notes in Computer Science vol. 711 1993 Springer Berlin 84 104
23. F. Honsell, and M. Lenisa Semantical analysis of perpetual strategies in λ -calculus Theoret. Comput. Sci. 212 1-2 1999 183 209
24. 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
25. D. Park The Y -combinator in Scott's λ -calculus models (revised version), Theory of Computation Report 13, Department of Computer Science 1976 University of Warwick
26. G.D. Plotkin Call-by-name, call-by-value and the λ -calculus Theoret. Comput. Sci. 1 2 1975 125 159
27. G.D. Plotkin Set-theoretical and other elementary models of the λ -calculus Theoret. Comput. Sci. 121 1-2 1993 351 409
28. D.S. Scott Continuous lattices F.W. Lawvere Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics vol. 274 1972 Springer Berlin 97 136
29. D.S. Scott Open problem C. Böhm Lambda Calculus and Computer Science Theory, Lecture Notes in Computer Science vol. 37 1975 Springer Berlin 369
30. S. van Bakel Complete restrictions of the intersection type discipline Theoret. Comput. Sci. 102 1 1992 135 163
31. S. Vickers Topology Via Logic 1989 Cambridge University Press Cambridge