Behavioural inverse limit λ-models

Theoretical Computer Science

Volumn 316, Issue 1-3, 2004, Pages 49-74

  Dezani Ciancaglini, Mariangiola ^a   Ghilezan, Silvia ^b   Likavec, Silvia ^a,b,c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF NOVI SAD   (Serbia)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

Intersection types; Lambda calculus; Models of lambda calculus; Reducibility method; Stone dualities

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; INVERSE PROBLEMS; NUMERICAL METHODS; SEMANTICS; SET THEORY;

INTERSECTION TYPES; LAMBDA CALCULUS; MODELS OF LAMBDA CALCULUS; REDUCIBILITY METHOD; STONE DUALITIES;

MATHEMATICAL MODELS;

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

References (34)

1. Abramsky S. Domain theory in logical form. Ann. Pure Appl. Logic. 51(1-2):1991;1-77.
2. Abramsky S., Ong C.-H.L. Full abstraction in the lazy lambda calculus. Inform. Comput. 105(2):1993;159-267.
3. F. Alessi, Strutture di tipi, teoria dei domini e modelli del lambda calcolo, Ph.D. Thesis, Torino University, 1991.
4. F. Alessi, M. Dezani-Ciancaglini, S. Lusin, Intersection types and domain operators, Theoret. Comput. Sci. 2004, this volume; doi: 10.1016/j.tcs.2004.01. 022 .
5. Amadio R.M., Curien P.-L. Domains and Lambda-Calculi. 1998;Cambridge University Press, Cambridge.
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. H.P. Barendregt, The Lambda Calculus: its Syntax and Semantics, North-Holland, Amsterdam (revised ed.), 1984.
8. Böhm C., Dezani-Ciancaglini M. λ -terms as total or partial functions on normal forms Böhm C. λ -calculus and Computer Science Theory Lecture Notes in Computer Science. Vol. 37:1975;96-121 Springer, Berlin.
9. Coppo M., Dezani M., Longo G. Applicative information systems. Ausiello G., Protasi M. CAAP'83, Trees in Algebra and Programming. 1983;35-64 Springer, Berlin.
10. Coppo M., Dezani-Ciancaglini M., Honsell F., Longo G. Extended type structures and filter lambda models. Lolli G., Longo G., Marcja A. Logic Colloquium '82. 1984;241-262 North-Holland, Amsterdam.
11. M. Dezani-Ciancaglini, S. Ghilezan, A lambda model characterizing computational behaviours of terms, in: Y. Toyama (Ed.), Internat. Workshop on Rewriting in Proof and Computation, 2001, pp. 100-119.
12. Dezani-Ciancaglini M., Ghilezan S. Two behavioural lambda models. Geuvers H., Wiedijk F. Types for Proofs and Programs. Lecture Notes in Computer Science. Vol. 2646:2003;127-147 Springer, Berlin.
13. Dezani-Ciancaglini M., Honsell F., Motohama Y. Compositional characterization of. λ -terms using intersection types Nielsen M., Rovan B. Mathematical Foundations of Computer Science 2000. Lecture Notes in Computer Science. Vol. 1893:2000;304-313 Springer, Berlin.
14. Gallier J. Typing untyped. λ -terms, or reducibility strikes again Ann. Pure Appl. Logic. 91:1998;231-270.
15. Ghilezan S. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic. 37(1):1996;44-52.
16. Gierz G.K., Hofmann K.H., Keimel K., Mislove L.J.D.M.W., Scott D.S. A Compendium of Continuous Lattices. 1980;Springer, Berlin.
17. Girard J.-Y. Une extension de l'interprétation de Gödel à l'analyse, et son application à l'elimination des coupures dans l'analyse et la théorie des types. Fenstadt J.E. Second Scandinavian Logic Symposium. 1971;63-92 North-Holland, Amsterdam.
18. Johnstone P.T. Stone Spaces. 1986;Cambridge University Press, Cambridge. (reprint of the 1982 ed.).
19. Koletsos G. Church-Rosser theorem for typed functionals. J. Symbolic Logic. 50:1985;782-790.
20. Krivine J.-L. Lambda-calcul, Types et Modèles. 1990;Masson, Paris.
21. Krivine J.-L. Lambda-calculus, Types and Models. 1993;Ellis Horwood, New York. (translated from the 1990 French original by René Cori).
22. Leivant D. Typing and computational properties of lambda expressions. Theoret. Comput. Sci. 44(1):1986;51-68.
23. P. Martin-Löf, Lecture notes on domain interpretation of type theory, in: P. Dybier, B. Nordström, K. Petersson, J. Smith (Eds.), Workshop on the Semantics of Programming Languages, Programming Methodology Group, Chalmers University of Technology, 1983.
24. J.C. Mitchell, Type systems for programming languages, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 415-431.
25. Mitchell J.C. Foundation for Programming Languages. 1996;MIT Press, Boston.
26. Plotkin G.D. Set-theoretical and other elementary models of the. λ -calculus Theoret. Comput. Sci. 121(1-2):1993;351-409.
27. Pottinger G. A type assignment for the strongly normalizable. λ -terms Seldin J.P., Hindley J.R. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. 1980;561-577 Academic Press, London.
28. Scott D.S. Continuous lattices. Lawvere F.W. Toposes, Algebraic Geometry and Logic. Lecture Notes in Mathematics. Vol. 274:1972;97-136 Springer, Berlin.
29. Scott D.S. Open problem. Böhm C. Lambda Calculus and Computer Science Theory. Lecture Notes in Computer Science. Vol. 37:1975;369 Springer, Berlin.
30. Scott D.S. Domains for denotational semantics. Nielsen M., Schmidt E.M. Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 140:1982;577-613 Springer, Berlin.
31. Statman R. Logical relations and the typed. λ -calculus Inform. Control. 65:1985;85-97.
32. Tait W.W. Intensional interpretations of functionals of finite type I. J. Symbolic Logic. 32:1967;198-212.
33. Tait W.W. A realizability interpretation of the theory of species. Parikh R. Logic Colloquium. Lecture Notes in Mathematics. Vol. 453:1975;240-251 Springer, Berlin.
34. van Bakel S. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci. 102(1):1992;135-163.