{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:44:43Z","timestamp":1762458283466,"version":"build-2065373602"},"reference-count":23,"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":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00351-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:11:15Z","timestamp":1027577475000},"page":"197-221","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Completeness of intersection and union type assignment systems for call-by-value \u03bb-models"],"prefix":"10.1016","volume":"272","author":[{"given":"Hajime","family":"Ishihara","sequence":"first","affiliation":[]},{"given":"Toshihiko","family":"Kurata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00351-0_BIB1","unstructured":"S. van Bakel, M. Dezani-Ciancaglini, U. de'Liguoro, Y. Motohama, The minimal relevant logic and the call-by-value lambda calculus, manuscript, 1998."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1995.1086","article-title":"Intersection and union types: syntax and semantics","volume":"119","author":"Barbanera","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB3","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)00351-0_BIB4","doi-asserted-by":"crossref","unstructured":"M. Coppo, M. Dezani-Ciancaglini, F. Honsell, G. Longo, Extended type structures and filter lambda models, Logic Colloquium \u201982, North-Holland, Amsterdam, 1983 pp. 241\u2013262.","DOI":"10.1016\/S0049-237X(08)71819-6"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB5","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"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB6","unstructured":"M. Dezani-Ciancaglini, personal communication, 1997."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB7","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, E. Giovannetti, U. de'Liguoro, Intersection types, \u03bb-model and B\u00f6hm-trees, MSJ Memoirs, vol. 2: Theories of Types and Proofs, 1998, pp. 45\u201397.","DOI":"10.2969\/msjmemoirs\/00201C020"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB8","first-page":"149","article-title":"Operational, denotational and logical descriptions","volume":"16","author":"Egidi","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1994.1016","article-title":"Singleton, union and intersection types for program extraction","volume":"109","author":"Hayashi","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB10","doi-asserted-by":"crossref","unstructured":"J.R. Hindley, The simple semantics for Coppo\u2013Dezani\u2013Sall\u00e9 types, ISP \u201982, Lecture Notes in Computer Science, vol. 137, Springer, Berlin, 1982, pp. 212\u2013226.","DOI":"10.1007\/3-540-11494-7_15"},{"year":"1996","series-title":"Basic Simple Type Theory","author":"Hindley","key":"10.1016\/S0304-3975(00)00351-0_BIB11"},{"year":"1986","series-title":"Introduction to Combinators and \u03bb-Calculus","author":"Hindley","key":"10.1016\/S0304-3975(00)00351-0_BIB12"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","article-title":"An ideal model of recursive polymorphic types","volume":"71","author":"MacQueen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","article-title":"Polymorphic type inference and containment","volume":"76","author":"Mitchell","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB15","unstructured":"Y. Motohama, The call-by-value type discipline over the minimal relevant logic B+, manuscript, 1997."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB16","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."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB17","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\/S0304-3975(00)00351-0_BIB18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1994.1018","article-title":"A semantics for static type inference","volume":"109","author":"Plotkin","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00351-0_BIB19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF00650498","article-title":"The semantics of entailment III","volume":"1","author":"Routley","year":"1972","journal-title":"J. Philos. Logic"},{"volume":"Vol. 1","year":"1988","author":"Troelstra","key":"10.1016\/S0304-3975(00)00351-0_BIB20"},{"year":"1996","series-title":"Basic Proof Theory","author":"Troelstra","key":"10.1016\/S0304-3975(00)00351-0_BIB21"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00370149","article-title":"Duality for algebras of relevant logics","volume":"56","author":"Urquhart","year":"1996","journal-title":"Studia Logica"},{"key":"10.1016\/S0304-3975(00)00351-0_BIB23","doi-asserted-by":"crossref","unstructured":"H. Yokouchi, Syntax and semantics of type assignment systems MSJ Memoirs, vol. 2: Theories of Types and Proofs, 1998, pp. 99\u2013141.","DOI":"10.2969\/msjmemoirs\/00201C030"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:21Z","timestamp":1759625541000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003510"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00351-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Completeness of intersection and union type assignment systems for call-by-value -models","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00351-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}