{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:29:12Z","timestamp":1770287352625,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1719158, CCF-1423617"],"award-info":[{"award-number":["CCF-1719158, CCF-1423617"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,8]]},"DOI":"10.1145\/3331545.3342594","type":"proceedings-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T20:51:45Z","timestamp":1564433505000},"page":"58-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Making a faster Curry with extensional types"],"prefix":"10.1145","author":[{"given":"Paul","family":"Downen","sequence":"first","affiliation":[{"name":"University of Oregon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Sullivan","sequence":"additional","affiliation":[{"name":"University of Oregon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zena M.","family":"Ariola","sequence":"additional","affiliation":[{"name":"University of Oregon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(88)90009-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596640"},{"key":"e_1_3_2_1_3_1","volume-title":"TFP 2014","author":"Breitner Joachim","year":"2014","unstructured":"Joachim Breitner . 2014 . Call Arity. In Trends in Functional Programming - 15th International Symposium , TFP 2014 , Soesterberg, The Netherlands , May 26-28, 2014. Revised Selected Papers. 34\u201350. Joachim Breitner. 2014. Call Arity. In Trends in Functional Programming - 15th International Symposium, TFP 2014, Soesterberg, The Netherlands, May 26-28, 2014. Revised Selected Papers. 34\u201350."},{"key":"e_1_3_2_1_4_1","volume-title":"FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings. 50\u201364","author":"Cousineau Guy","year":"1985","unstructured":"Guy Cousineau , Pierre-Louis Curien , and Michel Mauny . 1985 . The Categorical Abstract Machine. In Functional Programming Languages and Computer Architecture , FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings. 50\u201364 . Guy Cousineau, Pierre-Louis Curien, and Michel Mauny. 1985. The Categorical Abstract Machine. In Functional Programming Languages and Computer Architecture, FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings. 50\u201364."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275572"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-010-9050-z"},{"key":"e_1_3_2_1_7_1","volume-title":"27th EACSL Annual Conference on Computer Science Logic, CSL 2018","author":"Downen Paul","year":"2018","unstructured":"Paul Downen and Zena M. Ariola . 2018. Beyond Polarity: Towards a MultiDiscipline Intermediate Language with Sharing . In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018 , September 4-7, 2018 , Birmingham, UK. 21:1\u201321:23. Paul Downen and Zena M. Ariola. 2018. Beyond Polarity: Towards a MultiDiscipline Intermediate Language with Sharing. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK. 21:1\u201321:23."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062357"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_1_10_1","volume-title":"Cambridge University Press","author":"Girard Jean-Yves","unstructured":"Jean-Yves Girard , Paul Taylor , and Yves Lafont . 1989. Proofs and Types . Cambridge University Press , New York, NY, USA . Jean-Yves Girard, Paul Taylor, and Yves Lafont. 1989. Proofs and Types. Cambridge University Press, New York, NY, USA."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268947"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_1_13_1","unstructured":"Xavier Leroy. 1990. The ZINC experiment: an economical implementation of the ML language. Technical report 117. INRIA.  Xavier Leroy. 1990. The ZINC experiment: an economical implementation of the ML language. Technical report 117. INRIA."},{"key":"e_1_3_2_1_14_1","volume-title":"Queen Mary and Westfield College","author":"Levy Paul Blain","unstructured":"Paul Blain Levy . 2001. Call-By-Push-Value. Ph.D. Dissertation . Queen Mary and Westfield College , University of London. Paul Blain Levy. 2001. Call-By-Push-Value. Ph.D. Dissertation. Queen Mary and Westfield College, University of London."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016856"},{"key":"e_1_3_2_1_16_1","volume-title":"Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order","author":"McDermott Dylan","unstructured":"Dylan McDermott and Alan Mycroft . 2019. Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order . In Programming Languages and Systems, Lu\u00eds Caires (Ed.). Springer International Publishing , Cham , 235\u2013262. Dylan McDermott and Alan Mycroft. 2019. Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order. In Programming Languages and Systems, Lu\u00eds Caires (Ed.). Springer International Publishing, Cham, 235\u2013262."},{"key":"e_1_3_2_1_17_1","volume-title":"Focalisation and Classical Realisability. In Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL (CSL","author":"Munch-Maccagnoni Guillaume","year":"2009","unstructured":"Guillaume Munch-Maccagnoni . 2009 . Focalisation and Classical Realisability. In Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL (CSL 2009), Erich Gr\u00e4del and Reinhard Kahle (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 409\u2013423. Guillaume Munch-Maccagnoni. 2009. Focalisation and Classical Realisability. In Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL (CSL 2009), Erich Gr\u00e4del and Reinhard Kahle (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 409\u2013423."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000319"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture. Springer-Verlag","author":"Simon","unstructured":"Simon L. Peyton Jones and John Launchbury. 1991. Unboxed Values As First Class Citizens in a Non-Strict Functional Language . In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture. Springer-Verlag , London, UK, UK, 636\u2013666. Simon L. Peyton Jones and John Launchbury. 1991. Unboxed Values As First Class Citizens in a Non-Strict Functional Language. In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture. Springer-Verlag, London, UK, UK, 636\u2013666."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535861"},{"key":"e_1_3_2_1_23_1","volume-title":"Peyton Jones","author":"Xu Dana N.","year":"2005","unstructured":"Dana N. Xu and Simon L . Peyton Jones . 2005 . Arity Analysis. (2005). Working notes. Dana N. Xu and Simon L. Peyton Jones. 2005. Arity Analysis. (2005). Working notes."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2008.01.001"}],"event":{"name":"ICFP '19: ACM SIGPLAN International Conference on Functional Programming","location":"Berlin Germany","acronym":"ICFP '19","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331545.3342594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331545.3342594","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331545.3342594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:39Z","timestamp":1750202019000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331545.3342594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":23,"alternative-id":["10.1145\/3331545.3342594","10.1145\/3331545"],"URL":"https:\/\/doi.org\/10.1145\/3331545.3342594","relation":{},"subject":[],"published":{"date-parts":[[2019,8,8]]},"assertion":[{"value":"2019-08-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}