Two behavioural lambda models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2646, Issue , 2003, Pages 127-147

  Dezani Ciancaglini, Mariangiola ^a   Ghilezan, Silvia ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

INTERSECTION TYPE ASSIGNMENT SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 21144459051     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_8     Document Type: Article

References (30)

1. Samson Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51(1-2):1-77, 1991.
2. Samson Abramsky and C.-H. Luke Ong. Full abstraction in the lazy lambda calculus. Inform. and Comput., 105(2):159-267, 1993.
3. Fabio Alessi. Strutture di tipi, teoria dei domini e modelli del lambda calcolo. PhD thesis, Torino University, 1991.
4. Roberto M. Amadio and Pierre-Louis Curien. Domains and Lambda-Calculi. Cambridge University Press, Cambridge, 1998.
5. Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic, 48(4):931-940 (1984), 1983.
6. Henk P. Barendregt. The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition, 1984.
7. Corrado Böhm and Mariangiola Dezani-Ciancaglini. λ-terms as total or partial functions on normal forms. In C. Böhm, editor, λ-calculus and Computer Science Theory, volume 37 of Lecture Notes in Computer Science, pages 96-121, Berlin, 1975. Springer.
8. Mario Coppo, Mariangiola Dezani-Ciancaglini, Furio Honsell, and Giuseppe Longo. Extended type structures and filter lambda models. In G. Lolli, G. Longo, and A. Marcja, editors, Logic colloquium '82, pages 241-262, Amsterdam, 1984. North-Holland.
9. Mariangiola Dezani-Ciancaglini and Silvia Ghilezan. A lambda model characterizing computational behaviours of terms. In Y. Toyama, editor, International Workshop on Rewriting in Proof and Computation, RPC'01, pages 100-119, 2001.
10. Mariangiola Dezani-Ciancaglini, Furio Honsell, and Yoko Motohama. Compositional characterization of λ-terms using intersection types. In Mathematical Foundations of Computer Science 2000, volume 1893 of Lecture Notes in Computer Science, pages 304-313. Springer-Verlag, 2000.
11. Jean Gallier. Typing untyped λ-terms, or reducibility strikes again! Ann. Pure Appl. Logic, 91:231-270, 1998.
12. Silvia Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44-52, 1996.
13. Jean-Yves Girard. 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. In J.E. Fenstadt, editor, 2nd Scandinavian Logic Symposium, pages 63-92. North-Holland, 1971.
14. Peter T. Johnstone. Stone Spaces. Cambridge University Press, Cambridge, 1986. Reprint of the 1982 edition.
15. George Koletsos. Church-Rosser theorem for typed functionals. Journal of Symbolic Logic, 50:782-790, 1985.
16. Jean-Louis Krivine. Lambda-calcul Types et modèles. Masson, Paris, 1990.
17. Jean-Louis Krivine. Lambda-calculus, types and models. Ellis Horwood, New York, 1993. Translated from the 1990 French original by René Cori.
18. Daniel Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51-68, 1986.
19. Per Martin-Löf. Lecture notes on domain interpretation of type theory. Programming Methodology Group, Workshop on the Semantics of Programming Languages, Chalmers University of Technology, 1983.
20. John C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 415-431. Elsevier, Amsterdam, 1990.
21. John C. Mitchell. Foundation for Programmimg Languages. MIT Press, 1996.
22. Gordon D. Plotkin. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci., 121(1-2):351-409, 1993.
23. Garrel Pottinger. A type assignment for the strongly normalizable λ-terms. In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561-577. Academic Press, London, 1980.
24. Dana S. Scott. Continuous lattices. In F.W. Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics, pages 97-136, Berlin, 1972. Springer.
25. Dana S. Scott. Open problem. In C. Böhm, editor, Lambda Calculus and Computer Science Theory, volume 37 of Lecture Notes in Computer Science, page 369. Springer, Berlin, 1975.
26. Dana S. Scott. Domains for denotational semantics. In M. Nielsen and E.M. Schmidt, editors, Automata, Languages and Programming, pages 577-613. Springer, Berlin, 1982.
27. Richard Statman. Logical relations and the typed λ-calculus. Information and Control, 65:85-97, 1985.
28. William W. Tait. Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic, 32:198-212, 1967.
29. William W. Tait. A readability interpretation of the theory of species. In R. Parikh, editor, Logic Colloquium, volume 453 of Lecture Notes in Mathematics, pages 240-251. Springer, 1975.
30. Steffen van Bakel. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci., 102(1):135-163, 1992.