{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:02:33Z","timestamp":1778292153592,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90306-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"303-324","source":"Crossref","is-referenced-by-count":20,"title":["Intersection types for combinatory logic"],"prefix":"10.1016","volume":"100","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Roger","family":"Hindley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90306-Z_BIB1","series-title":"The Lambda Calculus","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB3","series-title":"Logic Colloquium '82","first-page":"241","article-title":"Extended type strucures and filter lambda models","author":"Coppo","year":"1983"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","article-title":"Functional characters of solvable terms","volume":"27","author":"Coppo","year":"1981","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","article-title":"Type-theories, normal forms and D\u221e-\u03bb-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB6_1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2370619","article-title":"Grundlagen der kombinatorischen Logik","volume":"52","author":"Curry","year":"1930","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB6_2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.2307\/2370716","article-title":"Grundlagen der kombinatorischen Logik","volume":"52","author":"Curry","year":"1930","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB7","volume":"Vol. I","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB8","series-title":"Compiling Functional Languages","author":"Diller","year":"1988"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/malq.19770230708","article-title":"Combinatory reductions and lambda reductions compared","volume":"23","author":"Hindley","year":"1977","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1090\/S0002-9947-1978-0492300-7","article-title":"Standard and normal reductions","volume":"241","author":"Hindley","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB11","first-page":"212","article-title":"The simple semantics for Coppo-Dezani-Sall\u00e9 types","volume":"Vol. 137","author":"Hindley","year":"1982"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB12","doi-asserted-by":"crossref","unstructured":"J.R. Hindley, Types with intersection, an introduction, Formal Aspects of Computing, to appear.","DOI":"10.1007\/BF01211394"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB13","series-title":"Introduction to Combinators and \u03bb-Calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB14","series-title":"Internal Report CSA\/13\/1984","article-title":"The complexity of a translation of \u03bb-calculus to combinators","author":"Kennaway","year":"1984"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB15","year":"1989"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB16","series-title":"Internal Report","article-title":"Complexity of combinatory code","author":"Mulder","year":"1985"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(89)90143-6","article-title":"Abstraction problems in combinatory logic: a compositive approach","volume":"66","author":"Piperno","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB18","unstructured":"J.C. Reynolds, Preliminary design of the programming language Forsythe, Report CMU-CS-88-159, Computer Science Dept., Carnegie-Mellon University, Schenley Park, Pittsburgh, USA."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0019-9958(82)80022-3","article-title":"Characterization theorems for a filter lambda model","volume":"54","author":"della Rocca","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB20","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(83)90069-5","article-title":"Principal type schemes for an extended type theory","volume":"28","author":"della Rocca","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","article-title":"\u00dcber die Bausteine der mathematischen Logik","volume":"92","author":"Sch\u00f6nfinkel","year":"1924","journal-title":"Math. Ann."},{"key":"10.1016\/0304-3975(92)90306-Z_BIB22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","article-title":"Another algorithm for bracket abstraction","volume":"44","author":"Turner","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB23","series-title":"Ph.D. Thesis","article-title":"Aspects of the implementation of programming languages: the compilation of an applicative language to combinatory logic","author":"Turner","year":"1981"},{"key":"10.1016\/0304-3975(92)90306-Z_BIB24","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for D\u221e-models of the lambda calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290306Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290306Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:49Z","timestamp":1555113529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290306Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290306Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90306-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}