A complete characterization of complete intersection-type preorders

ACM Transactions on Computational Logic

Volumn 4, Issue 1, 2003, Pages 120-147

  Dezani Ciancaglini, M ^a   Honsell, F ^b   Alessi, F ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Completeness; Intersection types; Lambda calculus; Lambda models

Indexed keywords

COMPLETENESS; INTERSECTION TYPES; LAMBDA CALCULUS; LAMBDA MODELS;

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

COMPUTATIONAL METHODS;

EID: 3042818025     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/601775.601780     Document Type: Article

References (34)

1. ABRAMSKY, S. 1991. Domain theory in logical form. Ann. Pure Appl. Logic 51, 1-2, 1-77.
2. ABRAMSKY, S. AND ONG, C.-H. L. 1993. Full abstraction in the lazy lambda calculus. Inform. Computat. 105, 2, 159-267.
3. BARENDREGT, H. 1984. The Lambda Calculus: Its Syntax and Semantics, revised ed. North-Holland, Amsterdam, The Netherlands.
4. BARENDREGT, H., COPPO, M., AND DEZANI-CIANCAGLINI, M. 1983. A filter lambda model and the completeness of type assignment. J. Symbolic Logic 48, 4, 931-940.
5. BARENDREGT, H. P. ET AL. In press. Typed λ-Calculus and Applications. North-Holland, Amsterdam, The Netherlands.
6. BERLINE, C. 2000. From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoret. Comput. Sci. 249, 81-161.
7. COPPO, M. AND DEZANI-CIANCAGLINI, M. 1980. An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Formal Logic 21, 4, 685-693.
8. COPPO, M., DEZANI-CIANCAGLINI, M., HONSELL, F., AND LONGO, G. 1984. Extended type structures and filter lambda models. In Logic Colloquium '82, G. Lolli, G. Longo, and A. Marcja, Eds. North-Holland, Amsterdam, The Netherlands, 241-262.
9. COPPO, M., DEZANI-CIANCAGLINI, M., AND VENNERI, B. 1981. Functional characters of solvable terms. Z. Math. Logik Grundlag. Math. 27, 1, 45-58.
10. ∞-lambda-models. Inform. Computat. 72, 2, 85-116.
11. DEZANI-CIANCAGLINI, M., HONSELL, F., AND ALESSI, F. 2000. A complete characterization of the complete intersection-type theories. In Proceedings in Informatics, J. Rolim, A. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hromkovic, U. Vaccaro, and J. Wells, Eds. ITRS'00 Workshop, vol. 8. Carleton-Scientific, Waterloo, Ont., Canada, 287-301.
12. DEZANI-CIANCAGLINI, M. AND MARGARIA, I. 1986. A characterization of F-complete type assignments. Theoret. Comput. Sci. 45, 2, 121-157.
13. EGIDI, L., HONSELL, F., AND RONCHI DELLA ROCCA, S. 1992. Operational, denotational and logical descriptions: A case study. Fund. Inform. 16, 2, 149-169.
14. ENGELER, E. 1981. Algebras and combinators. Algebra Universalis 13, 3, 389-392.
15. HINDLEY, J. AND SELDIN, J. 1986. Introduction to Combinators and λ-Calculus. Cambridge University Press, Cambridge, U.K.
16. HINDLEY, J. R. 1982. The simple semantics for Coppo-Dezani-Sallé types. In International Symposium on Programming, M. Dezani-Ciancaglini and U. Montanari, Eds. Lecture Notes in Computer Science, vol. 137. Springer, Berlin, Germany, 212-226.
17. HINDLEY, J. R. 1983a. The completeness theorem for typing λ-terms. Theoret. Comput. Sci. 22, 1-17.
18. HINDLEY, J. R. 1983b. Curry's type-rules are complete with respect to F-semantics too. Theoret. Comput. Sci. 22, 127-133.
19. HINDLEY, J. R. AND LONGO, G. 1980. Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math. 26, 4, 289-310.
20. HONSELL, F. AND LENISA, M. 1999. Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci. 212, 1-2, 183-209.
21. HONSELL, F. AND RONCHI DELLA ROCCA, S. 1992. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci. 45, 1, 49-75.
22. MITCHELL, J. 1988. Polymorphic type inference and containment. Inform. Computat. 76, 2-3, 211-249.
23. PARK, D. 1976. The Y-combinator in Scott's λ-calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warwick, Coventry, U.K.
24. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 1, 2, 125-159.
25. PLOTKIN, G. D. 1993. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci. 121, 1-2, 351-409.
26. POTTINGER, G. 1980. A type assignment for the strongly normalizable λ-terms. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. Hindley and J. Seldin, Eds. Academic Press, London, U.K., 561-577.
27. SCOTT, D. 1972. Continuous lattices. In Toposes, Algebraic Geometry and Logic, F. Lawvere, Ed. Lecture Notes in Mathematics, vol. 274. Springer, Berlin, Germany, 97-136.
28. SCOTT, D. 1975. Open problem. In Lambda Calculus and Computer Science Theory, C. Böhm, Ed. Lecture Notes in Computer Science, vol. 37. Springer, Berlin, Germany, 369.
29. SCOTT, D. 1976. Data types as lattices. SIAM J. Comput. 5, 3, 522-587.
30. SCOTT, D. 1980a. Lambda calculus: Some models, some philosophy. In The Kleene Symposium, J. Barwise, H. J. Keisler, and K. Kunen, Eds. North-Holland, Amsterdam, The Netherlands, 223-265.
31. SCOTT, D. S. 1980b. Letter to Albert Meyer. Carnegie Mellon University, Pittsburgh, PA.
32. VAN BAKEL, S. 1992. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci. 102, 1, 135-163.
33. VICKERS, S. 1989. Topology Via Logic. Cambridge University Press, Cambridge.
34. YOKOUCHI, H. 1994. F-semantics for type assignment systems. Theoret. Comput. Sci. 129, 1, 39-77.