The “Relevance” of intersection and union types

Notre Dame Journal of Formal Logic

Volumn 38, Issue 2, 1997, Pages 246-269

  Dezani Ciancaglini, Mariangiola ^a   Ghilezan, Silvia ^b   Venneri, Betti ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF NOVI SAD   (Serbia)

^c UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005666858     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1039724889     Document Type: Article

References (20)

1. Abramsky, S., “Domain theory in logical form,” Annals of Pure and Applied Logic, vol. 51 (1991), pp. 1-77.
2. Alessi, F., and F. Barbanera, “Strong conjunction and intersection types,” LNCS, vol. 520 (1991), Springer-Verlag, Berlin, pp. 64-73.
3. Barbanera, F., and M. Dezani-Ciancaglini, “Intersection and union types,” LNCS, vol. 526 (1991), Springer-Verlag, Berlin, pp. 651-74.
4. Barbanera, F., M. Dezani-Ciancaglini, and U. de’Liguoro, “Intersection and union types: syntax and semantics,” Information and Computation, vol. 119 (1995), pp. 202-30.
5. Barbanera, F., and S. Martini, “Proof functional connectives and realizability,” Archive for Mathematical Logic, vol. 33 (1994), pp. 189-211.
6. Coppo, M., M. Dezani-Ciancaglini, and B. Venneri, “Functional characters of solvable terms,” Zeitschrift für mathematiche Logik und Grundlagen der Mathematik, vol. 27 (1981), pp. 45-58.
7. Coppo, M., and A. Ferrari, “Type inference, abstract interpretation and strictness analysis,” Theoretical Computer Science, vol. 121 (1993), pp. 113-43.
8. Curry, H. B., and K. Feys, Combinatory Logic, North-Holland, Amsterdam, 1958.
9. Dezani-Ciancaglini, M., and J. R. Hindley, “Intersection types for combinatory logic,” Theoretical Computer Science, vol. 100 (1992), pp. 303-24.
10. Dummet, M., “A propositional calculus with denumerable matrics,” The Journal Symbolic Logic, vol. 24 (1959), pp. 97-106.
11. Harrop, R., “Concerning formulas of the types A → B ∨ C, A → (Ex)B(x) in intuitionistic formal systems,” The Journal of Symbolic Logic, vol. 25 (1960), pp. 27-32.
12. Hindley, J. R., “Coppo-Dezani types do not correspond to propositional logic,” Theoretical Computer Science, vol. 28 (1984), pp. 235-36.
13. Hindley, J. R., and J. P. Seldin, Introduction to Combinators and λ-Calculus, Cambridge University Press, Cambridge, 1986.
14. Jensen, T., “Strictness analysis in logical form,” LNCS, vol. 532 (1991), Springer-Verlag, Berlin, pp. 352-66.
15. Lopez-Escobar, E. G. K., “Proof functional connectives,” LNM, vol. 1130 (1985), Springer-Verlag, Berlin, pp. 208-21.
16. MacQueen, D., G. Plotkin, and R. Sethi, “An ideal model for recursive polymorphic types,” Information and Control, vol. 71 (1986), pp. 95-130.
17. Meyer, R. K., and R. Routley, “Algebraic analysis of entailment I,” Logique et Analyse, vol. 15 (1972), pp. 407-28.
18. Meyer, R. K., and R. Routley, “The semantics of entailment III,” Journal of Philosophical Logic, vol. 1 (1972), pp. 192-208.
19. Mints, G. E., “The completeness of provable realizability,” Notre Dame Journal of Formal Logic, vol. 30 (1989), pp. 420-41.
20. Venneri, B., “Intersection types as logical formulae,” Journal of Logic and Computation, vol. 4 (1994), pp. 109-124.