Intersection and union types: Syntax and semantics

Information and Computation

Volumn 119, Issue 2, 1995, Pages 202-230

  Barbanera, Franco ^a   Dezani Ciancaglini, Mariangiola ^a   De’liguoro, Ugo ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001526119     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1086     Document Type: Article

References (52)

1. Abramsky, S. (1991), Domain theory in logical form, Ann. Pure Appl. Logic 51, 1-77.
2. Alessi, F. (1994), Elementary type structures, in "CAAP '94," pp. 37-51, Lecture Notes in Computer Science, Vol. 787, Springer-Verlag, Berlin.
3. Altenkirch T. (1983), "Ein konstruktiver Ansatz zur konjunktiven Typisierung des A-Kalkulus," Diplomarbeit, Technische Universitat Berlin.
4. Barbanera, F., and Dezani Ciancaglini, M. (1991), Intersection and union types, in "TACS '91," pp. 651-674, Lecture Notes in Computer Science, Vol. 526, Springer-Verlag, Berlin.
5. Barendregt, H. P. (1984), "The Lambda Calculus: Its Syntax and Semantics," Studies in Logic and the Foundations of Mathematics, Vol. 103, North-Holland, Amsterdam.
6. Barendregt, H. P., Coppo, M., and Dezani-Ciancaglini, M. (1983), A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48, 931-940.
7. Berardi, S. (1990), personal communication.
8. Berarducci, A. (1983), "Programmazione funzionale e rappresentabilita in alcuni sistemi di logica combinatoria," Tesi di Laurea, Universita di Roma.
9. Beth, E. W. (1965), "The Foundation of Mathematics," 2nd ed., North-Holland, Amsterdam.
10. Bohm, C. (1966), The CUCH as a formal and description language, in "Formal Language Description for Computer Programming," pp. 179-197, North-Holland, Amsterdam.
11. Bohm, C. (1985), Functional programming and combinatory algebras, in "MFCS '88," pp. 14-26, Lecture Notes in Computer Science, Vol. 324, Springer-Verlag, Berlin.
12. Boudol, G. (1990), "A Lambda-Calculus for Parallel Functions," Rapport de Recherche INRIA 1231.
13. Boudol, G. (1994), A lambda-calculus for (strict) parallel functions. Inform, and Compul. 108, 51-127.
14. Cardone, F., Dezani-Ciancaglini, M., and de'Liguoro, U. (1994), Com bining type disciplines, Ann. Pure Appl. Logic 66, 197-230.
15. Coppo, M. (1991), personal communication.
16. Coppo, M., Dezani-Ciancaglini, M., Honsell, F., and Longo, G. (1984), Extended type structures and filter lambda models, in "Logic Colloquium 82," pp. 241-262, North-Holland, Amsterdam.
17. Coppo, M., Dezani-Ciancaglini, M., and Longo, G. (1983), Applicative information systems, in "CAAP '83," pp. 35-64, Lecture Notes in Computer Science, Vol. 159, Springer-Verlag, Berlin.
18. Coppo, M., Dezani-Ciancaglini, M., and Venneri, B. (1981), Functional characters of solvable terms, Z. Math. Logik 27, 45-58.
19. Coppo, M., and Ferrari, A. (1993), Type inference, abstract interpretation and strictness analysis, Theoret. Compul. Sci. 121, 113-144.
20. Curry, H., and Feys, R. (1958), "Combinatory Logic," North-Holland, Amsterdam.
21. Dezani-Ciancaglini, M., Ghilezan, S., and Venneri, B. (1992), "The 'Relevance' of Intersection and Union Types," Internal Report, Universita di Torino.
22. Dezani-Ciancaglini, M., de'Liguoro, U., and Piperno, A. (1993), Filter models for a parallel and non deterministic λ.-calculus, in "MFCS '93," pp. 403-412, Lecture Notes in Computer Science, Vol. 7111, Springer-Verlag, Berlin.
23. Dezani-Ciancaglini, M., de'Liguoro, U., and Piperno, A. (1994), Fully abstract semantics for concurrent λ-calculus, in "TACS '94," pp. 16-35, Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin.
24. Gentzen, G. (1969), "The Collected Papers of Gerhard Gentzen," (M. Szabo, Ed.), North-Holland, Amsterdam.
25. Harrop, R. (1960), Concerning formulas of the types A → B v C, A → (Ex) B(x) in intuitionistic formal systems, J. Symbolic Logic 25, 27-32.
26. Hindley, R. (1982), The simple semantics for Coppo-Dezani-Salle Types, in "ISP '82," pp. 212-226, Lecture Notes in Computer Science, Vol. 137, Springer-Verlag, Berlin.
27. Hindley, R. (1983), The completeness theorem for typing lambda terms, Theoret. Comput. Sci. 22, 1-17.
28. Hindley, R. (1984), Coppo-Dezani types do not correspond to proposi-tional logic, Theoret. Comput. Sci. 28, 235-236.
29. Jensen, T. P. (1992), Disjunctive strictness analysis, in "LICS '92," pp. 174-185, IEEE Comput. Soc. Press, Silver Spring, MD.
30. Knuth, D. E. (1970), Examples of formal semantics, in "Symposium on Semantics and Algorithmic Languages," pp. 212-235, Lecture Notes in Mathematics, Vol. 188, Springer-Verlag, Berlin/New York.
31. Kripke, S. (1959), A completeness theorem in modal logic, J. Symbolic 24, 1-14.
32. Leivant, D. (1990), Discrete polymorphism, in "VI ACM Conference on LISP and Functional Programming," pp. 288-297.
33. Lopez-Escobar, E. G. K. (1985), Proof functional connectives, pp. 208-221, Lecture Notes in Mathematics, Vol. 1130, Springer-Verlag, Berlin.
34. MacQueen, D., Plotkin, G., and Sethi, R. (1986), An ideal model for recursive polymorphic types, Inform, and Control 71, 95-130.
35. Meyer, A. (1982), What is a model of the lambda calculus?, Inform, and Control 52, 87-122.
36. Meyer, A., Mitchell, J. C., Moggi, E., and Statman, R. (1985), Empty types in polymorphic lambda calculus, in "14th ACM Symposium on Principles of Programming Languages," 253-262.
37. Mitchell, J., and Moggi, E. (1991), Kripke-style models for typed lambda calculus, Ann. Pure Appl. Logic 51, 99-124.
38. Ong, C.-H. L. (1992), The concurrent lambda calculus 1: A general precongruence theorem for applicative bisimulation, unpublished manuscript, Cambridge Univ. Computer Laboratory.
39. Ong, C.-H. L. (1993), Non-determinism in a functional setting, in "LICS '93," pp. 275-286, IEEE Comput. Soc. Press, Silver Spring, MD.
40. Pierce, B. (1989), "A Decision Procedure for the Subtype Relation on Intersection Types with Bounded Variables," Tecnical Report CMU-CS-89-169, Carnegie Mellon University.
41. Pierce, B. (1990), "Preliminary Investigation of a Calculus with Intersection and Union types," Internal Report, Carnegie Mellon University.
42. Pierce, B. (1991a), "Programming with Intersection Types, Union Types and Polymorphism," Technical Report CMU-CS-91-106, Carnegie Mellon University.
43. Pierce, B. (1991b), personal communication.
44. Prawitz, D. (1965), Natural Deduction, Almqvist & Wiksell, Stockolm.
45. Reynolds, J. C. (1988), "Preliminary Design of the Programming Language FORSYTHE," Report CMU-CS-88-159, Carnegie Mellon University.
46. Reynolds, J. C. (1989), Syntactic control of inference part 2, in "ICALP '89," pp. 704-722, Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin.
47. Ronchi della Rocca, S., and Venneri, B., (1984), Principal type schemes for an extended type theory, Theoret. Comput. Sci. 28, 151-171
48. Routley, R., and Meyer, R. K. (1972), The semantics of entailment, III., J. Philosophical Logic 1, 192-208.
49. Scott, D. E. (1981), "Lectures on a Mathematical Theory of Computation," Monograph PRG-19, Computing Laboratory, Oxford Univ.
50. Scott, D. E. (1982), Domains for denotational semantics, in "ICALP '82," pp. 577-613, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, Berlin.
51. Verschuur, L. (1993), Semantic agreement of anaphors and extended type theory, in "Proc. Eastern States Conf. on Linguistics '93," to appear.
52. Wadsworth, C. (1976), The relation between computational and denotational properties for D, -models of the lambda calculus, SIAM J. Comput. 5, 488-521.