{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:04Z","timestamp":1761611104398},"reference-count":20,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1997,4,1]]},"DOI":"10.1305\/ndjfl\/1039724889","type":"journal-article","created":{"date-parts":[[2003,2,25]],"date-time":"2003-02-25T21:04:25Z","timestamp":1046207065000},"source":"Crossref","is-referenced-by-count":20,"title":["The \"Relevance\" of Intersection and Union Types"],"prefix":"10.1215","volume":"38","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Ghilezan","sequence":"additional","affiliation":[]},{"given":"Betti","family":"Venneri","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., \u201cDomain theory in logical form,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 51 (1991), pp. 1\u201377. Zbl 0737.03006 MR 93e:03040","DOI":"10.1016\/0168-0072(91)90065-T"},{"key":"2","doi-asserted-by":"crossref","unstructured":"Alessi, F., and F. Barbanera, \u201cStrong conjunction and intersection types,\u201d <i>LNCS<\/i>, vol. 520 (1991), Springer-Verlag, Berlin, pp. 64\u201373. Zbl 0765.03007 MR 1135350","DOI":"10.1007\/3-540-54345-7_49"},{"key":"3","doi-asserted-by":"crossref","unstructured":"Barbanera, F., and M. Dezani-Ciancaglini, \u201cIntersection and union types,\u201d <i>LNCS<\/i>, vol. 526 (1991), Springer-Verlag, Berlin, pp. 651\u201374. MR 93g:68071","DOI":"10.1007\/3-540-54415-1_69"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Barbanera, F., M. Dezani-Ciancaglini, and U. de'Liguoro, \u201cIntersection and union types: syntax and semantics,\u201d <i>Information and Computation<\/i>, vol. 119 (1995), pp. 202\u201330. Zbl 0832.68065 MR 96c:68111","DOI":"10.1006\/inco.1995.1086"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Barbanera, F., and S. Martini, \u201cProof functional connectives and realizability,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 33 (1994), pp. 189\u2013211. Zbl 0801.03035 MR 95e:03156","DOI":"10.1007\/BF01203032"},{"key":"6","doi-asserted-by":"crossref","unstructured":"Coppo, M., M. Dezani-Ciancaglini, and B. Venneri, \u201cFunctional characters of solvable terms,\u201d <i>Zeitschrift f\u00fcr mathematiche Logik und Grundlagen der Mathematik<\/i>, vol. 27 (1981), pp. 45\u201358. Zbl 0479.03006 MR 82j:03011","DOI":"10.1002\/malq.19810270205"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Coppo, M., and A. Ferrari, \u201cType inference, abstract interpretation and strictness analysis,\u201d <i>Theoretical Computer Science<\/i>, vol. 121 (1993), pp. 113\u201343. Zbl 0832.68008 MR 95i:68073","DOI":"10.1016\/0304-3975(93)90086-9"},{"key":"8","unstructured":"Curry, H. B., and K. Feys, <i>Combinatory Logic<\/i>, North-Holland, Amsterdam, 1958. Zbl 0081.24104 MR 20:817"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Dezani-Ciancaglini, M., and J. R. Hindley, \u201cIntersection types for combinatory logic,\u201d <i>Theoretical Computer Science<\/i>, vol. 100 (1992), pp. 303\u201324. Zbl 0771.03004 MR 93i:03018","DOI":"10.1016\/0304-3975(92)90306-Z"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Dummet, M., \u201cA propositional calculus with denumerable matrics,\u201d <i>The Journal Symbolic Logic<\/i>, vol. 24 (1959), pp. 97\u2013106. Zbl 0089.24307","DOI":"10.2307\/2964753"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Harrop, R., \u201cConcerning formulas of the types $A\\rightarrow B\\vee C$, $A\\rightarrow (Ex)B(x)$ in intuitionistic formal systems,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 25 (1960), pp. 27\u201332. Zbl 0098.24201 MR 24:A686","DOI":"10.2307\/2964334"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Hindley, J. R., \u201cCoppo-Dezani types do not correspond to propositional logic,\u201d <i>Theoretical Computer Science<\/i>, vol. 28 (1984), pp. 235\u201336. Zbl 0529.03003 MR 86i:03015","DOI":"10.1016\/0304-3975(83)90074-9"},{"key":"13","unstructured":"Hindley, J. R., and J. P. Seldin, <i>Introduction to Combinators and $\\lambda $-Calculus<\/i>, Cambridge University Press, Cambridge, 1986. Zbl 0614.03014 MR 88j:03009"},{"key":"14","doi-asserted-by":"crossref","unstructured":"Jensen, T., \u201cStrictness analysis in logical form,\u201d <i>LNCS<\/i>, vol. 532 (1991), Springer-Verlag, Berlin, pp. 352\u201366. MR 93a:68081","DOI":"10.1007\/3540543961_17"},{"key":"15","doi-asserted-by":"crossref","unstructured":"Lopez-Escobar, E. G. K., \u201cProof functional connectives,\u201d <i>LNM<\/i>, vol. 1130 (1985), Springer-Verlag, Berlin, pp. 208\u201321. Zbl 0615.03047 MR 87b:03052","DOI":"10.1007\/BFb0075313"},{"key":"16","doi-asserted-by":"publisher","unstructured":"MacQueen, D., G. Plotkin, and R. Sethi, \u201cAn ideal model for recursive polymorphic types,\u201d <i>Information and Control<\/i>, vol. 71 (1986), pp. 95\u2013130. Zbl 0636.68016 MR 88h:68058","DOI":"10.1016\/S0019-9958(86)80019-5"},{"key":"17","unstructured":"Meyer, R. K., and R. Routley, \u201cAlgebraic analysis of entailment I,\u201d <i>Logique et Analyse<\/i>, vol. 15 (1972), pp. 407\u201328. Zbl 0336.02020 MR 48:5857"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Meyer, R. K., and R. Routley, \u201cThe semantics of entailment III,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 1 (1972), pp. 192\u2013208. Zbl 0317.02019 MR 53:12878","DOI":"10.1007\/BF00650498"},{"key":"19","doi-asserted-by":"crossref","unstructured":"Mints, G. E., \u201cThe completeness of provable realizability,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 30 (1989), pp. 420\u201341. Zbl 0704.03004 MR 91f:03123","DOI":"10.1305\/ndjfl\/1093635158"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Venneri, B., \u201cIntersection types as logical formulae,\u201d <i>Journal of Logic and Computation<\/i>, vol. 4 (1994), pp. 109\u2013124. Zbl 0798.03013 MR 95b:68068","DOI":"10.1093\/logcom\/4.2.109"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1039724889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:13:04Z","timestamp":1706649184000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-38\/issue-2\/The-Relevance-of-Intersection-and-Union-Types\/10.1305\/ndjfl\/1039724889.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4,1]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[1997,4,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1039724889","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4,1]]}}}