{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:56Z","timestamp":1761610256979,"version":"build-2065373602"},"reference-count":11,"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)80489-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"37-52","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polar Type Inference with Intersection Types and \u03c9"],"prefix":"10.1016","volume":"70","author":[{"given":"S\u00e9bastien","family":"Carlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80489-4_bib1","doi-asserted-by":"crossref","unstructured":"Damas, L. and R. Milner, Principle Type Inference for Functional Programs (extended abstract), in: 9th ACM Symposium on Principle of Programming Languages, 1982, pp. 207\u2013212.","DOI":"10.1145\/582153.582176"},{"key":"10.1016\/S1571-0661(04)80489-4_bib2","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y., Linear Logic: its syntax and semantics, in: J.-Y. Girard, Y. Lafont and L. Regnier, editors, Advances in Linear Logic (1995), pp. 1\u201342. URL http:\/\/citeseer.nj.nec.com\/girard95linear.html","DOI":"10.1017\/CBO9780511629150.002"},{"year":"1990","series-title":"\"The Definition of Standard ML,\"","author":"Harper","key":"10.1016\/S1571-0661(04)80489-4_bib3"},{"key":"10.1016\/S1571-0661(04)80489-4_bib4","series-title":"Functional Programming","article-title":"An Introduction to Program Specialisation by Type Inference","author":"Hughes","year":"1996"},{"key":"10.1016\/S1571-0661(04)80489-4_bib5","unstructured":"Jim, T., What are principal typings and what are they good for?, Tech. memo. MIT\/LCS\/TM-532, MIT (1995). URL http:\/\/www.research.att.com\/~trevor\/papers.html"},{"author":"Jim","key":"10.1016\/S1571-0661(04)80489-4_bib6"},{"key":"10.1016\/S1571-0661(04)80489-4_bib7","unstructured":"Jones, S. L. P., C. V. Hall, K. Hammond, W. Partain and P. Wadler, The glasgow haskell compiler: a technical overview, in: Proc. UK Joint Framework for Information Technology (JFIT) Technical Conference, 93. URL citeseer.nj.nec.com\/jones92glasgow.html"},{"key":"10.1016\/S1571-0661(04)80489-4_bib8","first-page":"137","article-title":"Beta-reduction as unification","volume":"Volume 46","author":"Kfoury","year":"1999"},{"key":"10.1016\/S1571-0661(04)80489-4_bib9","doi-asserted-by":"crossref","unstructured":"Kfoury, A. J. 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., 1999, pp. 161\u2013174. URL http:\/\/types.bu.edu\/reports\/Kfo+Wel:POPL-1999.html","DOI":"10.1145\/292540.292556"},{"author":"Thiemann","key":"10.1016\/S1571-0661(04)80489-4_bib10"},{"author":"Well","key":"10.1016\/S1571-0661(04)80489-4_bib11"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804894?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:02Z","timestamp":1761609962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804894"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80489-4","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":"Polar Type Inference with Intersection Types and \u03c9","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)80489-4","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"}]}}