{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:10:08Z","timestamp":1750446608999,"version":"3.41.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2003,3,6]],"date-time":"2003-03-06T00:00:00Z","timestamp":1046908800000},"content-version":"unspecified","delay-in-days":33,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2003,2]]},"abstract":"<jats:p>This paper presents a novel method for comparing computational properties of \u03bb-terms that are typeable with intersection types, with respect to terms that are typeable with Curry types. We introduce a translation from intersection typing <jats:italic>derivations<\/jats:italic> to Curry typeable <jats:italic>terms<\/jats:italic> that is preserved by \u03b2-reduction: this allows the simulation of a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach proves strong normalisation for the intersection system naturally by means of purely syntactical techniques. The paper extends the results presented in Bucciarelli <jats:italic>et al.<\/jats:italic> (1999) to the whole intersection type system of Barendregt, Coppo and Dezani, thus providing a complete proof of the conjecture, proposed in Leivant (1990), that all functions uniformly definable using intersection types are already definable using Curry types.<\/jats:p>","DOI":"10.1017\/s0960129502003833","type":"journal-article","created":{"date-parts":[[2003,3,17]],"date-time":"2003-03-17T11:56:01Z","timestamp":1047902161000},"page":"15-53","source":"Crossref","is-referenced-by-count":4,"title":["Intersection types and \u03bb-definability"],"prefix":"10.1017","volume":"13","author":[{"given":"ANTONIO","family":"BUCCIARELLI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ADOLFO","family":"PIPERNO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"IVANO","family":"SALVO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,3,6]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129502003833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T18:34:49Z","timestamp":1750444489000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129502003833\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0960129502003833"],"URL":"https:\/\/doi.org\/10.1017\/s0960129502003833","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"type":"print","value":"0960-1295"},{"type":"electronic","value":"1469-8072"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}