{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:13Z","timestamp":1761610333787,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80228-2","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"38-51","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Towards Higher-Order Types"],"prefix":"10.1016","volume":"14","author":[{"given":"Carlos","family":"Camar\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc\u00edlia","family":"Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80228-2_BIB1","first-page":"207","article-title":"Principal type schemes for functional programs","author":"Luis","year":"1982","journal-title":"Proc. 9th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB2","doi-asserted-by":"crossref","unstructured":"Hall, C., K. Hammond, S.P. Jones and P. Wadler. Type Classes in Haskell. Proc. 5th European Symposium on Programming, pages 241-256, 1994. Springer LNCS 788.","DOI":"10.1007\/3-540-57880-3_16"},{"year":"1994","series-title":"Qualified Types","author":"Mark","key":"10.1016\/S1571-0661(05)80228-2_BIB3"},{"issue":"5","key":"10.1016\/S1571-0661(05)80228-2_BIB4","article-title":"Report on the Programming Language Haskell","volume":"27","author":"Peyton Jones","year":"1992","journal-title":"ACM. SigPlan Notices"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB5","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":"Robin","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"year":"1989","series-title":"The Definition of Standard ML","author":"Robin","key":"10.1016\/S1571-0661(05)80228-2_BIB6"},{"year":"1996","series-title":"Foundations for programming languages","author":"Mitchell","key":"10.1016\/S1571-0661(05)80228-2_BIB7"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB8","article-title":"A Second Look at Overloading","author":"Odersky","year":"1995","journal-title":"Conference Record of Functional Programming and Computer Architecture"},{"year":"1996","series-title":"ML for the Working Programmer","author":"Paulson","key":"10.1016\/S1571-0661(05)80228-2_BIB9"},{"year":"1996","series-title":"Haskell: The Craft of Functional Programming","author":"Thompson","key":"10.1016\/S1571-0661(05)80228-2_BIB10"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB11","doi-asserted-by":"crossref","unstructured":"Turner, D. A., A non-strict functional language with polymorphic types. In Proceedings of the 2nd International Conference on Functional Programming and Computer Architecture. IEEE Computer Society Press, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB12","first-page":"13","article-title":"Essential Intersection Type Assignment","volume":"761","author":"van Bakel","year":"1993"},{"key":"10.1016\/S1571-0661(05)80228-2_BIB13","article-title":"How to make ad-hoc polymorphism less ad hoc","author":"Philip","year":"1989","journal-title":"Conf. Record of the 16th ACM Symposium on Principles of Programming Languages"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802282?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:07:30Z","timestamp":1761610050000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":13,"alternative-id":["S1571066105802282"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80228-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards Higher-Order Types","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(05)80228-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}