Source: Notre Dame J. Formal Logic Volume 43, Number 3
(2002), 129-145.
References
[1] Anderson, A. R., and N. D. Belnap, Jr., Entailment. Vol. I. The Logic of Relevance and Necessity., Princeton University Press, Princeton, 1975.
[2] Anderson, A. R., N. D. Belnap, Jr., and J. M. Dunn, Entailment. The Logic of Relevance and Necessity. Vol. II, Princeton University Press, Princeton, 1992.
[3] 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.
[4] Barendregt, H. P., The Lambda Calculus. Its Syntax and Semantics, revised edition, vol. 103 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1984.
[5] Barendregt, H., M. Coppo, and M. Dezani-Ciancaglini, "A filter lambda model and the completeness of type assignment", The Journal of Symbolic Logic, vol. 48 (1983), pp. 931--40.
[6] Curry, H. B., Foundations of Mathematical Logic, McGraw-Hill Book Co., New York, 1963.
[7] Curry, H. B., and R. Feys, Combinatory Logic. Vol. I, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1958.
Mathematical Reviews (MathSciNet):
MR20:817
[8] Dezani-Ciancaglini, M., A. Frisch, E. Giovannetti, and Y. Motohama, "The relevance of semantic subtyping", in ITRS 2002, vol. 70 (1) of Electric Notes in Theoretical Computer Science, edited by S. van Bakel, 2002. \hrefhttp://www.elsevier.nl/locate/entcs/volume70.htmlhttp://www.elsevier.nl/locate/entcs/volume70.html
[9] Dezani-Ciancaglini, M., and J. R. Hindley, "Intersection types for combinatory logic", Theoretical Computer Science, vol. 100 (1992), pp. 303--24.
[10] Dunn, J. M., The Algebra of Intensional Logics, Ph.D. thesis, University of Pittsburgh, 1966.
[11] Frisch, A., G. Castagna, and V. Benzaken, "Semantic subtyping", pp. 137--46 in Seventeenth IEEE Symposium on Logic in Computer Science, edited by G. Plotkin, IEEE Computer Society Press, 2002.
[12] Harrop, R., "Concerning formulas of the types $A\rightarrow B\bigvee C,\,A\rightarrow (Ex)B(x)$" in intuitionistic formal systems, The Journal of Symbolic Logic, vol. 25 (1960), pp. 27--32.
[13] Hindley, J. R., and G. Longo, "Lambda-calculus models and extensionality", Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 26 (1980), pp. 289--310.
[14] Hindley, J. R., and J. P. Seldin, Introduction to Combinators and $\lambda$-Calculus, vol. 1 of London Mathematical Society Student Texts, Cambridge University Press, Cambridge, 1986.
[15] Kripke, S. A., "Semantical analysis of modal logic. I. Normal modal propositional calculi", Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 9 (1963), pp. 67--96.
[16] Leblanc, H., "On dispensing with things and worlds", pp. 103--19 in Existence, Truth, and Provability, edited by H. Leblanc, State University of New York Press, Albany, 1982. Originally published in Logic and Ontology, pp. 241--59, edited by M. K. Munitz, New York University Press, New York, 1973.
[17] Meyer, R. K., and R. Routley, "Algebraic analysis of entailment. I", Logique et Analyse, Nouvelle Série, vol. 15 (1972), pp. 407--28.
[18] Routley, R., and R. K. Meyer, "The semantics of entailment. III", Journal of Philosophical Logic, vol. 1 (1972), pp. 192--208.
[19] Routley, R., V. Plumwood, R. K. Meyer, and R. T. Brady, Relevant Logics and Their Rivals. Part I, Ridgeview Publishing Co., Atascadero, 1982.
[20] van Bakel, S., M. Dezani-Ciancaglini, U. de'Liguoro, and Y. Motohama, "The minimal relevant logic and the call-by-value lambda calculus", Technical Report TR-ARP-05-2000, Australian National University, 2000.
[21] Venneri, B., "Intersection types as logical formulae", Journal of Logic and Computation, vol. 4 (1994), pp. 109--24.