{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:50Z","timestamp":1761610250989,"version":"build-2065373602"},"reference-count":19,"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)80494-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"124-148","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implementing Compositional Analysis Using Intersection Types With Expansion Variables"],"prefix":"10.1016","volume":"70","author":[{"given":"Assaf","family":"Kfoury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Washburn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.B.","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"unstructured":"American National Standards Institute and International Organization for Standardization. Information processing: text and office systems: Standard Generalized Markup Language (SGML). American National Standards Institute, 1430 Broadway, New York, NY 10018, USA, 1985.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80494-8_NEWBIB2","series-title":"Programming Languages & Systems, 9th European Symp. Programming, volume 1782 of LNCS","first-page":"26","article-title":"Faithful translations between polyvariant flows and polymorphic types","author":"Amtoft","year":"2000"},{"unstructured":"Tim Bray, Jean Paoli, C. M. Sperberg-McQueen, and Eve Maler. Extensible Markup Language (XML) 1.0 (second edition). W3C Recommendation - http:\/\/www.w3.org\/TR\/2000\/REC-xml-200001006, October 2001","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB3"},{"unstructured":"James Clark and Murata Makoto. RELAX NG Specification. Oasis Committee Specification http:\/\/www.oasis-open.org\/committees\/relax-ng\/spec-20011203.html. December 2001.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB4"},{"doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238\u2013252, Los Angeles, California, 1977. ACM Press, New York, NY.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB5","DOI":"10.1145\/512950.512973"},{"unstructured":"David C. Fallside. XML Schema Part 0: Primer. W3C Recommendation - http:\/\/www.w3.org\/TR\/2001\/REC-xmlschema-0-20010502\/, May 2001.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB6"},{"doi-asserted-by":"crossref","unstructured":"Haruo Hosoya and Benjamin C. Pierce. XDuce: A typed XML processing language (preliminary report). In WebDB (Informal Proceedings), pages 111\u2013116, 2000.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB7","DOI":"10.1007\/3-540-45271-0_15"},{"unstructured":"Trevor Jim. What are principal typings and what are they good for? Tech. memo. MIT\/LCS\/TM-532, MIT, 1995.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB8"},{"doi-asserted-by":"crossref","unstructured":"Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pages 137\u2013158. Springer-Verlag, 1999.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB9","DOI":"10.4064\/-46-1-137-158"},{"doi-asserted-by":"crossref","unstructured":"Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, and J. B. Wells. Relating typability and expressibility in finite-rank intersection type systems. In Proc. 1999 Int'l Conf. Functional Programming, pages 90\u2013101. ACM Press, 1999.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB10","DOI":"10.1145\/317636.317788"},{"doi-asserted-by":"crossref","unstructured":"Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161\u2013174, 1999. Superseded by [12].","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB11","DOI":"10.1145\/292540.292556"},{"unstructured":"Assaf J. Kfoury and J. B. Wells. Principality and type inference for intersection types using expansion variables. Supersedes [11], August 2002.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB12"},{"issue":"4","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine, part i","volume":"3","author":"John McCarthy","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(04)80494-8_NEWBIB14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci"},{"unstructured":"Santiago M. Pericas-Geertsen. XML-Fluent Mobile Ambients. PhD thesis, Boston University, 2001.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB15"},{"unstructured":"Geoffrey Washburn, Bennett Yates, Bradley Alan, J. B. Wells, and Assaf Kfoury. A tool for experimenting with system\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tI\n\t\t\t\t\t\t. http:\/\/types.bu.edu\/modular\/compositional\/experimentation-tool\/.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB16"},{"doi-asserted-by":"crossref","unstructured":"J. B. Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, volume 2380 of LNCS, pages 913\u2013925. Springer-Verlag, 2002.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB17","DOI":"10.1007\/3-540-45465-9_78"},{"key":"10.1016\/S1571-0661(04)80494-8_NEWBIB18","series-title":"Programming Languages & Systems, 11th European Symp. Programming, volume 2305 of LNCS","first-page":"115","article-title":"Branching types","author":"Wells","year":"2002"},{"unstructured":"Bennett Yates. Intersection types with expansion variables: The case of associative and commutative & with a new formulation of substitution. Unpublished.","key":"10.1016\/S1571-0661(04)80494-8_NEWBIB19"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804948?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:56Z","timestamp":1761609956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804948"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80494-8","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":"Implementing Compositional Analysis Using Intersection Types With Expansion Variables","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)80494-8","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"}]}}