Intersection types and domain operators

Theoretical Computer Science

Volumn 316, Issue 1-3, 2004, Pages 25-47

  Alessi, Fabio ^a   Dezani Ciancaglini, Mariangiola ^b   Lusin, Stefania ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Fixed point operators; Intersection types; Lambda calculus; Lambda theories; Models of lambda calculus

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS;

FIXED POINT OPERATORS; INTERSECTION TYPES; LAMBDA CALCULUS; LAMBDA THEORIES; MODELS OF LAMBDA CALCULUS;

MATHEMATICAL OPERATORS;

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

References (22)

1. Abramsky S. Domain theory in logical form. Ann. Pure Appl. Logic. 51(1-2):1991;1-77.
2. F. Alessi, Strutture di tipi, teoria dei domini e modelli del lambda calcolo, Ph.D. Thesis, Torino University, 1991.
3. Alessi F., Dezani-Ciancaglini M., Honsell F. Filter models and easy terms. Restivo A., Ronchi S., Roversi L. Italian Conf. on Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 2202:2001;17-37 Springer, Berlin.
4. Alessi F., Lusin S. Simple easy terms. van Bakel S. Intersection Types and Related Systems. Electronic Lecture Notes in Theoretical Computer Science. Vol. 70:2002;Elsevier, Amsterdam.
5. Baeten J., Boerboom B. ω can be anything it shouldn't be Indag. Math. 41:1979;111-120.
6. Barendregt H., Coppo M., Dezani-Ciancaglini M. A filter lambda model and the completeness of type assignment. J. Symbolic Logic. 48(4):1983;931-940.
7. Barendregt H.P. The Lambda Calculus: its Syntax and Semantics. Revised Edition:1984;North-Holland, Amsterdam.
8. Coppo M., Dezani-Ciancaglini M. An extension of the basic functionality theory for the. λ -calculus Notre Dame J. Formal Logic. 21(4):1980;685-693.
9. Coppo M., Dezani-Ciancaglini M., Honsell F., Longo G. Extended type structures and filter lambda models. Lolli G., Longo G., Marcja A. Logic Coll. '82. 1984;241-262 North-Holland, Amsterdam.
10. M. Coppo, M. Dezani-Ciancaglini, B. Venneri, Principal type schemes and λ -calculus semantics, in: R. Hindley, J. Seldin (Eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London, 1980, pp. 535-560.
11. ∞ -lambda-models Inform. and Comput. 72(2):1987;85-116.
12. M. Dezani-Ciancaglini, S. Ghilezan, S. Likavec, Behavioural inverse limit models, Theoret. Comput. Sci. 2004
13. M. Dezani-Ciancaglini, S. Lusin, Intersection types and lambda theories, in: S. Soloviev, R.D. Cosmo, G. Longo (Eds.), Internat. Workshop on Isomorphisms of Types, 2002. http://www.irit.fr/zeno/WIT2002/proceedings.shtml .
14. Honsell F., Ronchi Della Rocca S. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci. 45(1):1992;49-75.
15. Kuper J. On the Jacopini technique. Inform. and Comput. 138:1997;101-123.
16. S. Lusin, Intersection types, lambda abstraction algebras and lambda theories, Ph.D. Thesis, Venice University, 2002. ftp://ftp.cs.unibo.it/pub/ techreports/2003-07.pdf .
17. S. Lusin, A. Salibra, The lattice of lambda theories, J. Comput., 2004, to appear.
18. Plotkin G.D. Set-theoretical and other elementary models of the. λ -calculus Theoret. Comput. Sci. 121(1-2):1993;351-409.
19. Pottinger G. A type assignment for the strongly normalizable. λ -terms Seldin J., Hindley J. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. 1980;561-577 Academic Press, London.
20. Scott D.S. Continuous lattices. Lawvere F. Toposes, Algebraic Geometry and Logic. Lecture Notes in Mathematics. Vol. 274:1972;97-136 Springer, Berlin.
21. ∞ -models of the lambda-calculus SIAM J. Comput. 5(3):1976;488-521.
22. C. Zylberajch, Syntaxe et Semantique de la Facilité en Lambda-calcul, Ph.D. Thesis, Université Paris VII, 1991.