{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:52:51Z","timestamp":1770285171346,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T00:00:00Z","timestamp":1251936000000},"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":[[2009,9,3]]},"DOI":"10.1145\/1596638.1596640","type":"proceedings-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T12:53:09Z","timestamp":1252414389000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Types are calling conventions"],"prefix":"10.1145","author":[{"given":"Maximilian C.","family":"Bolingbroke","sequence":"first","affiliation":[{"name":"University Of Cambridge, Cambridge, United Kingdom"}]},{"given":"Simon L.","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"key":"e_1_3_2_2_2_1","first-page":"4","volume-title":"International Conference on Functional Programming","author":"Marlow S.","year":"2004","unstructured":"S. Marlow and S. Peyton Jones . How to make a fast curry: push\/enter vs eval\/apply . In International Conference on Functional Programming , pages 4 -- 15 , September 2004 . S. Marlow and S. Peyton Jones. How to make a fast curry: push\/enter vs eval\/apply. In International Conference on Functional Programming, pages 4--15, September 2004."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232630"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/3540543961_30","volume-title":"Functional Programming Languages and Computer Architecture","author":"Peyton Jones S.","year":"1991","unstructured":"S. Peyton Jones and John Launchbury . Unboxed values as first class citizens in a non-strict functional language . In Functional Programming Languages and Computer Architecture , pages 636 -- 666 . Springer , 1991 . S. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture, pages 636--666. Springer, 1991."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190315.1190324"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/21541.21543"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(97)00029-4"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004751"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289435"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.717691"},{"key":"e_1_3_2_2_13_1","volume-title":"Compiling with Continuations","author":"Appel A.","year":"1992","unstructured":"A. Appel . Compiling with Continuations . Cambridge University Press , 1992 . A. Appel. Compiling with Continuations. Cambridge University Press, 1992."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268951"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_4"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010006229549"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289426"},{"key":"e_1_3_2_2_20_1","volume-title":"A verified framework for higher-order uncurrying optimizations","author":"Dargaye Z.","year":"2009","unstructured":"Z. Dargaye and X. Leroy . A verified framework for higher-order uncurrying optimizations . March 2009 . Z. Dargaye and X. Leroy. A verified framework for higher-order uncurrying optimizations. March 2009."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000319"},{"key":"e_1_3_2_2_22_1","volume-title":"PiSigma: A core language for dependently typed programming","author":"Altenkirch T.","year":"2008","unstructured":"T. Altenkirch and N. Oury . PiSigma: A core language for dependently typed programming . 2008 . T. Altenkirch and N. Oury. PiSigma: A core language for dependently typed programming. 2008."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/36583.36603"}],"event":{"name":"ICFP '09: ACM SIGPLAN International Conference on Functional Programming","location":"Edinburgh Scotland","acronym":"ICFP '09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2nd ACM SIGPLAN symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1596638.1596640","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1596638.1596640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:28Z","timestamp":1750249408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1596638.1596640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,3]]},"references-count":20,"alternative-id":["10.1145\/1596638.1596640","10.1145\/1596638"],"URL":"https:\/\/doi.org\/10.1145\/1596638.1596640","relation":{},"subject":[],"published":{"date-parts":[[2009,9,3]]},"assertion":[{"value":"2009-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}