{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T16:16:55Z","timestamp":1689610615451},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":4184,"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":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00346-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:15Z","timestamp":1027591875000},"page":"3-40","source":"Crossref","is-referenced-by-count":6,"title":["Intersection types for \u03bb-trees"],"prefix":"10.1016","volume":"272","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[]},{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"additional","affiliation":[]},{"given":"Fer-Jan","family":"de Vries","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(00)00346-7_BIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy lambda calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Inform. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(00)00346-7_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1093\/logcom\/3.6.643","article-title":"Principal type schemes for the strict type assignment system","volume":"3","author":"van Bakel","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB3","series-title":"PROCOMET\u201998","first-page":"6","article-title":"Types for trees","author":"Barbanera","year":"1998"},{"key":"10.1016\/S0304-3975(00)00346-7_BIB4","unstructured":"H. Barendregt, The Lambda Calculus. Its Syntax and Semantics, North-Holland, Amsterdam, revised edition, 1984."},{"issue":"4","key":"10.1016\/S0304-3975(00)00346-7_BIB5","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\/S0304-3975(00)00346-7_BIB6","series-title":"Logic and Algebra","first-page":"339","article-title":"Infinite \u03bb-calculus and non-sensible models","author":"Berarducci","year":"1996"},{"issue":"1-2","key":"10.1016\/S0304-3975(00)00346-7_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(98)00135-2","article-title":"Infinite \u03bb-calculus and types","volume":"212","author":"Berarducci","year":"1999","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(00)00346-7_BIB8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/inco.1994.1003","article-title":"Lambda-calculi for (strict) parallel functions","volume":"108","author":"Boudol","year":"1994","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00346-7_BIB9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1996.0037","article-title":"The discriminating power of multiplicities in the \u03bb-calculus","volume":"126","author":"Boudol","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB10","series-title":"Logic Colloquium\u201982","first-page":"241","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"key":"10.1016\/S0304-3975(00)00346-7_BIB11","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"535","article-title":"Principal type schemes and \u03bb-calculus semantics","author":"Coppo","year":"1980"},{"issue":"2","key":"10.1016\/S0304-3975(00)00346-7_BIB12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","article-title":"Type theories, normal forms, and D\u221e-lambda-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Inform. Comput."},{"issue":"5","key":"10.1016\/S0304-3975(00)00346-7_BIB13","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1137\/S0097539794275860","article-title":"A filter model for concurrent \u03bb-calculus","volume":"27","author":"Dezani-Ciancaglini","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB14","series-title":"ICTCS\u201998","first-page":"1","article-title":"B\u00f6hm's theorem for B\u00f6hm trees","author":"Dezani-Ciancaglini","year":"1998"},{"key":"10.1016\/S0304-3975(00)00346-7_BIB15","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, P. Severi, F.-J. de Vries, B\u00f6hm's theorem for Berarducci trees, in: D. Wolfram (Ed.), CATS\u201900, Electronic Notes in Theoretical Computer Science, Vol. 31(1), Elsevier, Amsterdam, 2000, pp. 143\u2013166.","DOI":"10.1016\/S1571-0661(05)80329-9"},{"issue":"2","key":"10.1016\/S0304-3975(00)00346-7_BIB16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/inco.1998.2773","article-title":"Discrimination by parallel observers","volume":"150","author":"Dezani-Ciancaglini","year":"1999","journal-title":"Inform. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(00)00346-7_BIB17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebras and combinators","volume":"13","author":"Engeler","year":"1981","journal-title":"Algebra Univ."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB18","doi-asserted-by":"crossref","unstructured":"M. Hyland, A syntactic characterization of the equality in some models for the lambda calculus, J. London Math. Soc. (2) 12 (3) (1975\/76) 361\u2013370.","DOI":"10.1112\/jlms\/s2-12.3.361"},{"issue":"1","key":"10.1016\/S0304-3975(00)00346-7_BIB19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theoret. Comput Sci."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB20","first-page":"35","article-title":"Meaningless terms in rewriting","volume":"1","author":"Kennaway","year":"1999","journal-title":"J. Functional Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(00)00346-7_BIB21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb \u03b2 K-calculus, and an application of a labeled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00346-7_BIB22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of \u03bb-calculus: theories, expansions, isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(00)00346-7_BIB23","first-page":"62","article-title":"Infinite normal forms for the \u03bb-calculus","volume":"Vol. 37","author":"Nakajima","year":"1975"},{"issue":"3","key":"10.1016\/S0304-3975(00)00346-7_BIB24","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":"Ronchi della Rocca","year":"1982","journal-title":"Inform. Control"},{"issue":"1","key":"10.1016\/S0304-3975(00)00346-7_BIB25","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1994.1042","article-title":"The lazy lambda calculus in a concurrency scenario","volume":"111","author":"Sangiorgi","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB26","first-page":"97","article-title":"Continuous lattices","volume":"Vol. 274","author":"Scott","year":"1972"},{"issue":"3","key":"10.1016\/S0304-3975(00)00346-7_BIB27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00346-7_BIB28","first-page":"577","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"issue":"3","key":"10.1016\/S0304-3975(00)00346-7_BIB29","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's 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:S0304397500003467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003467?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:02:42Z","timestamp":1578448962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003467"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00346-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}