{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:19Z","timestamp":1772163919307,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"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":[[2008,9,20]]},"DOI":"10.1145\/1411204.1411216","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T09:39:01Z","timestamp":1222162741000},"page":"63-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["From ML to ML\n                    <sup>F<\/sup>"],"prefix":"10.1145","author":[{"given":"Didier","family":"R\u00e9my","sequence":"first","affiliation":[{"name":"INRIA, Rocquencourt, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Yakobowski","sequence":"additional","affiliation":[{"name":"INRIA, Rocquencourt, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169692"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944709"},{"key":"e_1_3_2_2_3_1","volume-title":"France","author":"Botlan Didier Le","year":"2007","unstructured":"Didier Le Botlan and Didier R\u00e9my. Recasting MLF. Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, June 2007."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291169"},{"key":"e_1_3_2_2_5_1","unstructured":"Daan Leijen. Flexible types: robust type inference for first-class polymorphism. Technical Report MSR-TR-2008-55 Microsoft Research March 2008."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","unstructured":"Daan Leijen. HMF: Simple type inference for first-class polymorphism. In ICFP'08 {15}. 10.1145\/1411204.1411245","DOI":"10.1145\/1411204.1411245"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759148.1759182"},{"key":"e_1_3_2_2_8_1","first-page":"389","volume-title":"Advanced Topics in Types and Programming Languages","author":"Pottier Fran\u00e7ois","year":"2005","unstructured":"Fran\u00e7ois Pottier and Didier R\u00e9my. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389--489. MIT Press, 2005."},{"key":"e_1_3_2_2_9_1","unstructured":"Didier R\u00e9my. Extending ML type system with a sorted equational theory. Research Report 1766 INRIA 1992."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190315.1190321"},{"key":"e_1_3_2_2_11_1","volume-title":"A Church-style intermediate language for MLF. Submitted,","author":"R\u00e9my Didier","year":"2008","unstructured":"Didier R\u00e9my and Boris Yakobowski. A Church-style intermediate language for MLF. Submitted, available at http:\/\/gallium.inria.fr\/~remy\/mlf, 2008."},{"key":"e_1_3_2_2_12_1","volume-title":"September","author":"R\u00e9my Didier","year":"2008","unstructured":"Didier R\u00e9my and Boris Yakobowski. A graphical presentation of MLF types with a linear-time incremental unification algorithm. Extended version, of {10}, September 2008."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Dimitrios Vytiniotis Stephanie Weirich and Simon Peyton Jones. FPH: First-class polymorphism for Haskell. In ICFP'08 {15}. 10.1145\/1411204.1411246","DOI":"10.1145\/1411204.1411246"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00047-5"},{"key":"e_1_3_2_2_15_1","volume-title":"13th ACM SIGPLAN International Conference on Functional Programming (ICFP'08)","author":"Proceedings","year":"2008","unstructured":"Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP'08), Victoria, British Columbia, Canada. ACM Press, September 2008."}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","location":"Victoria BC Canada","acronym":"ICFP08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411204.1411216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T16:40:58Z","timestamp":1755189658000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411216"}},"subtitle":["graphic type constraints with efficient type inference"],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":15,"alternative-id":["10.1145\/1411204.1411216","10.1145\/1411204"],"URL":"https:\/\/doi.org\/10.1145\/1411204.1411216","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1411203.1411216","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,9,20]]},"assertion":[{"value":"2008-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}