{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:48Z","timestamp":1761610368412,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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":3831,"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,2]]},"DOI":"10.1016\/s1571-0661(04)80491-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"72-87","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Subtyping in Logical Form"],"prefix":"10.1016","volume":"70","author":[{"given":"Ugo","family":"de'Liguoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1996","series-title":"A Theory of Objects","author":"Abadi","key":"10.1016\/S1571-0661(04)80491-2_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB2","first-page":"3355","article-title":"\u201cA Per Model of Polymorphism and Recursive Types\u201d","author":"Abadi","year":"1990","journal-title":"proc. of IEEE-LICS"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"\u201cDomain Theory in Logical Form\u201d","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Log"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90074-C","article-title":"\u201cRecursion over Realizability Structures\u201d","volume":"91","author":"Amadio","year":"1991","journal-title":"Info. Comp"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"\u201cA Filter Lambda-Model and the Completeness of Type Assignment\u201d","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symb. Log"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB6","first-page":"1964","article-title":"\u201cA Modest Model of Records, Inheritance, and Bounded Quantification\u201d","volume":"87","author":"Bruce","year":"1990","journal-title":"Info. Comp"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"K.B. Bruce, J.C. Mitchell, \u201cPER models of subtyping, recursive types and higher-order polymorphism\u201d, proc. of ACM-POPL 1992.","DOI":"10.1145\/143165.143230"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB8","first-page":"164","article-title":"\u201cRelational semantics for recursive types and bounded quantification\u201d","volume":"372","author":"Cardone","year":"1989","journal-title":"LNCS"},{"key":"10.1016\/S1571-0661(04)80491-2_NEWBIB9","article-title":"\u201cCharacterizing convergent terms in object calculi via intersection types\u201d","volume":"2044","author":"de'Liguoro","year":"2001","journal-title":"LNCS"},{"year":"1996","series-title":"Foundations for Programming Languages","author":"Mitchell","key":"10.1016\/S1571-0661(04)80491-2_NEWBIB10"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804912?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804912?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:05:54Z","timestamp":1761609954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804912"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80491-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Subtyping in Logical Form","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)80491-2","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"}]}}