{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:36Z","timestamp":1761611136844,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80496-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"163-181","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Intersection Typed \u03bb-calculus"],"prefix":"10.1016","volume":"70","author":[{"given":"Simona","family":"Ronchi Della Rocca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1984","series-title":"The \u039b-calculus: its syntax and semantics","author":"Barendregt","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB2","unstructured":"Capitani B., \u201cA Logical Characterization of Intersection Types\u201d, PhD thesis, Department of Mathematics, University of Siena, (2001)."},{"issue":"2","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB3","first-page":"180","article-title":"\u201cHyperformulae, Parallel Deductions and Intersection Types\u201d","volume":"50","author":"Capitani","year":"2001","journal-title":"Proc. BOTH 2001, Electronic Notes in Theoretical computer Science"},{"issue":"4","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB4","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"\u201cAn extension of the basic functionality theory for the \u03bb-calculus\u201d","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1-2","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(83)90074-9","article-title":"\u201cCoppo Dezani types do not correspond to propositional logic\u201d","volume":"28","author":"Hindley","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB6","series-title":"Logic Algebra and Computer Science","first-page":"241","article-title":"\u201cBeta-reduction as Unification\u201d","author":"Kfoury","year":"1999"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB7","series-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","first-page":"561","article-title":"\u201cA type assignment for the strongly normalizable \u03bb- terms\u201d","author":"Pottinger","year":"1980"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Ronchi Della Rocca S. and Roversi L. \u201cIntersection logic\u201d, Proc. of CSL'01, LNCS, 2142, Springer-Verlag, (2001), pp. 414\u2013428","DOI":"10.1007\/3-540-44802-0_29"},{"issue":"1","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","article-title":"\u201cComplete restrictions of the intersection type discipline\u201d","volume":"102","author":"van Bakel","year":"1992","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S1571-0661(04)80496-1_NEWBIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1093\/logcom\/4.2.109","article-title":"\u201cIntersection types as logical formulae\u201d","volume":"4","author":"Venneri","year":"1994","journal-title":"J. Logic Comput"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Wells J.B., Dimock A., Muller R., and Turbak F., \u201cA typed intermediate language for flow-directed compilation\u201d, In 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT97), pages 757\u2013771.","DOI":"10.1007\/BFb0030639"},{"key":"10.1016\/S1571-0661(04)80496-1_NEWBIB12","doi-asserted-by":"crossref","DOI":"10.1017\/S0956796801004245","article-title":"\u201cA Calculus with Polymorphic and Polyvariant Flow Types\u201d","author":"Wells","year":"2002","journal-title":"Journal of Functional Programming"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804961?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804961?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:05Z","timestamp":1761609965000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804961"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80496-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Intersection Typed \u03bb-calculus","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80496-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}