{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:12Z","timestamp":1761610332807,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3619,"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,9]]},"DOI":"10.1016\/s1571-0661(04)80843-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"45-59","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Intersection Types and Computational Rules"],"prefix":"10.1016","volume":"84","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"J. of Functional Progr"},{"issue":"1-2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB3","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. and Comput"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB4","series-title":"ICTCS'01 volume 2202 of LNCS","first-page":"17","article-title":"Filter models and easy terms","author":"Alessi","year":"2001"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB5","series-title":"ITRS'02 volume 70 of ENTCS","article-title":"Simple easy terms","author":"Alessi","year":"2002"},{"issue":"4","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB6","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"},{"issue":"4","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB7","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of the basic functionality theory for the \u03bb-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB8","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"},{"issue":"2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB9","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. and Comput"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB10","series-title":"Logic colloquium '82","first-page":"241","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"year":"1958","series-title":"Combinatory Logic, volume I of Studies in Logic and the Foundations of Mathematics","author":"Curry","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB11"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB12","series-title":"TYPES'02, volume 2646 of LNCS","first-page":"127","article-title":"Two behavioural lambda models","author":"Dezani-Ciancaglini","year":"2003"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB13","series-title":"MFCS'00, volume 1893 of LNCS","first-page":"304","article-title":"Compositional characterization of \u03bb-terms using intersection types","author":"Dezani-Ciancaglini","year":"2000"},{"issue":"2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB14","first-page":"149","article-title":"Operational, denotational and logical descriptions: a case study","volume":"16","author":"Engidi","year":"1992","journal-title":"Fund. Inform"},{"issue":"3","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB15","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 Universalis"},{"year":"1980","series-title":"A Compendium of Continuous Lattices","author":"Gierz","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB16"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB17","series-title":"MFCS'93, volume 711 of LNCS","first-page":"84","article-title":"Some results on the full abstraction problem for restricted lambda calculi","author":"Honsell","year":"1993"},{"issue":"1-2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","article-title":"Semantical analysis of perpetual strategies in \u03bb-calculus","volume":"212","author":"Honsell","year":"1999","journal-title":"Theoret. Comput. Sci"},{"issue":"1","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB19","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","article-title":"An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus","volume":"45","author":"Honsell","year":"1992","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB20","first-page":"1","article-title":"Calculi of generalized beta-reduction and explicit substitution: Type free and simply typed versions","volume":"5","author":"Kamareddine","year":"1998","journal-title":"J. of Functional and Logic Progr"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB21","unstructured":"D. Park. The Y-combinator in Scott's \u03bb-calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warick, 1976."},{"issue":"2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci"},{"issue":"1-2","key":"10.1016\/S1571-0661(04)80843-0_NEWBIB23","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","article-title":"Set-theoretical and other elementary models of the \u03bb-calculus","volume":"121","author":"Plotkin","year":"1993","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB24","series-title":"Toposes, algebraic geometry and logic volume 274 of LNM","first-page":"97","article-title":"Continuous lattices","author":"Scott","year":"1972"},{"key":"10.1016\/S1571-0661(04)80843-0_NEWBIB25","series-title":"Lambda Calculus and Computer Science Theory, volume 37 of LNCS","first-page":"369","article-title":"Open problem","author":"Scott","year":"1975"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808430?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:13Z","timestamp":1761609973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104808430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":25,"alternative-id":["S1571066104808430"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80843-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Intersection Types and Computational Rules","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)80843-0","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"}]}}