{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T15:17:09Z","timestamp":1787066229977,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T00:00:00Z","timestamp":1126483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,9,12]]},"DOI":"10.1145\/1086365.1086385","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T12:34:39Z","timestamp":1131366879000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Qualified types for MLF"],"prefix":"10.1145","author":[{"given":"Daan","family":"Leijen","sequence":"first","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andres","family":"L\u00f6h","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,9,12]]},"reference":[{"key":"e_1_3_2_1_2_1","first-page":"29","article-title":"The principal type scheme of an object in combinatory logic","volume":"146","author":"Hindley J.","year":"1969","unstructured":"J. Hindley . The principal type scheme of an object in combinatory logic . Transactions of the American Mathematical Society , 146 : 29 -- 60 , Dec. 1969 . J. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29--60, Dec. 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_3_2_1_3_1","volume-title":"European Symposium on Programming (ESOP'92)","volume":"582","author":"Jones M. P.","year":"1992","unstructured":"M. P. Jones . A theory of qualified types. In 4th . European Symposium on Programming (ESOP'92) , volume 582 of Lecture Notes in Computer Science, pages 287--306. Springer-Verlag , Feb. 1992 . M. P. Jones. A theory of qualified types. In 4th. European Symposium on Programming (ESOP'92), volume 582 of Lecture Notes in Computer Science, pages 287--306. Springer-Verlag, Feb. 1992."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944709"},{"key":"e_1_3_2_1_7_1","unstructured":"D. Leijen. Morrow: a row-oriented programming language. http:\/\/www.cs.uu.nl\/~daan\/morrow.html July 2004.  D. Leijen. Morrow: a row-oriented programming language. http:\/\/www.cs.uu.nl\/~daan\/morrow.html July 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325708"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"Milner R.","year":"1997","unstructured":"R. Milner , M. Tofte , R. Harper , and D. MacQueen . The Definition of Standard ML (Revised) . The MIT Press , 1997 . R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997."},{"key":"e_1_3_2_1_10_1","volume-title":"Haskell 98 Language and Libraries: The Revised Report","author":"Peyton Jones S.","year":"2003","unstructured":"S. Peyton Jones , editor. Haskell 98 Language and Libraries: The Revised Report . Cambridge University Press , 2003 . S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_11_1","volume-title":"Practical type inference for arbitrary-rank types. Submitted to the Journal of Functional Programming (JFP)","author":"Peyton-Jones S.","year":"2004","unstructured":"S. Peyton-Jones and M. Shields . Practical type inference for arbitrary-rank types. Submitted to the Journal of Functional Programming (JFP) , 2004 . S. Peyton-Jones and M. Shields. Practical type inference for arbitrary-rank types. Submitted to the Journal of Functional Programming (JFP), 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/997140.997142"}],"event":{"name":"ICFP05: ACM SIGPLAN International Conference on Functional Programming","location":"Tallinn Estonia","acronym":"ICFP05","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1086365.1086385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1086365.1086385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:12Z","timestamp":1750248492000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1086365.1086385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,12]]},"references-count":9,"alternative-id":["10.1145\/1086365.1086385","10.1145\/1086365"],"URL":"https:\/\/doi.org\/10.1145\/1086365.1086385","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1090189.1086385","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,9,12]]},"assertion":[{"value":"2005-09-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}