{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:26Z","timestamp":1780994606561,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T00:00:00Z","timestamp":1697932800000},"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":[[2023,10,22]]},"DOI":"10.1145\/3610612.3610622","type":"proceedings-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T23:13:48Z","timestamp":1697498028000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Closure Conversion in Little Pieces"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3023-1996","authenticated-orcid":false,"given":"Zachary J.","family":"Sullivan","sequence":"first","affiliation":[{"name":"University of Oregon, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0165-9387","authenticated-orcid":false,"given":"Paul","family":"Downen","sequence":"additional","affiliation":[{"name":"University of Massachusetts at Lowell, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5551-8294","authenticated-orcid":false,"given":"Zena M.","family":"Ariola","sequence":"additional","affiliation":[{"name":"University of Oregon, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Explicit Substitutions. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL \u201990)","author":"Abadi M.","year":"1989","unstructured":"M. Abadi , L. Cardelli , P.-L. Curien , and J.-J. Levy . 1989 . Explicit Substitutions. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL \u201990) . 31\u201346. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. 1989. Explicit Substitutions. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL \u201990). 31\u201346."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411227"},{"key":"e_1_3_2_2_3_1","volume-title":"Compiling with Continuations","author":"Appel W.","unstructured":"Andrew\u00a0 W. Appel . 1992. Compiling with Continuations . Cambridge University Press . Andrew\u00a0W. Appel. 1992. Compiling with Continuations. Cambridge University Press."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199507"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018","author":"J.","year":"2018","unstructured":"William\u00a0 J. Bowman and Amal Ahmed. 2018. Typed closure conversion for the calculus of constructions . In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018 , Philadelphia, PA, USA , June 18-22, 2018 . 797\u2013811. William\u00a0J. Bowman and Amal Ahmed. 2018. Typed closure conversion for the calculus of constructions. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018. 797\u2013811."},{"key":"e_1_3_2_2_6_1","volume-title":"27th EACSL Annual Conference on Computer Science Logic, CSL 2018","author":"Downen Paul","year":"2018","unstructured":"Paul Downen and Zena\u00a0 M. Ariola . 2018 . Beyond Polarity: Towards a Multi-Discipline 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\u00a0M. Ariola. 2018. Beyond Polarity: Towards a Multi-Discipline 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_2_7_1","volume-title":"Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts - III","author":"Felleisen Matthias","year":"1987","unstructured":"Matthias Felleisen and Daniel\u00a0 P. Friedman . 1987 . Control operators, the SECD-machine, and the \u03bb -calculus . In Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts - III , Ebberup, Denmark , 25-28 August 1986. 193\u2013222. Matthias Felleisen and Daniel\u00a0P. Friedman. 1987. Control operators, the SECD-machine, and the \u03bb -calculus. In Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts - III, Ebberup, Denmark, 25-28 August 1986. 193\u2013222."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"e_1_3_2_2_9_1","volume-title":"Selective Lambda Lifting. CoRR abs\/1910.11717","author":"Graf Sebastian","year":"2019","unstructured":"Sebastian Graf and Simon Peyton Jones . 2019. Selective Lambda Lifting. CoRR abs\/1910.11717 ( 2019 ). Sebastian Graf and Simon Peyton Jones. 2019. Selective Lambda Lifting. CoRR abs\/1910.11717 (2019)."},{"key":"e_1_3_2_2_10_1","volume-title":"Type systems for closure conversions. Types for Program Analysis","author":"Hannan John","year":"1995","unstructured":"John Hannan . 1995. Type systems for closure conversions. Types for Program Analysis ( 1995 ), 64. John Hannan. 1995. Type systems for closure conversions. Types for Program Analysis (1995), 64."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_2_12_1","unstructured":"Paul\u00a0Blain Levy. 2001. Call-by-push-value. Ph.\u00a0D. Dissertation. Queen Mary University of London UK.  Paul\u00a0Blain Levy. 2001. Call-by-push-value. Ph.\u00a0D. Dissertation. Queen Mary University of London UK."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003037"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017","author":"Maurer Luke","year":"2017","unstructured":"Luke Maurer , Paul Downen , Zena\u00a0 M. Ariola , and Simon\u00a0 L. Peyton Jones . 2017 . Compiling without continuations . In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017 , Barcelona, Spain , June 18-23, 2017. 482\u2013494. Luke Maurer, Paul Downen, Zena\u00a0M. Ariola, and Simon\u00a0L. Peyton Jones. 2017. Compiling without continuations. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, June 18-23, 2017. 482\u2013494."},{"key":"e_1_3_2_2_15_1","volume-title":"ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. 235\u2013262","author":"McDermott Dylan","year":"2019","unstructured":"Dylan McDermott and Alan Mycroft . 2019 . Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order. In Programming Languages and Systems - 28th European Symposium on Programming , ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. 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 - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. 235\u2013262."},{"key":"e_1_3_2_2_16_1","volume-title":"Typed Closure Conversion. In Conference Record of POPL\u201996: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St","author":"Minamide Yasuhiko","year":"1996","unstructured":"Yasuhiko Minamide , J.\u00a0 Gregory Morrisett , and Robert Harper . 1996 . Typed Closure Conversion. In Conference Record of POPL\u201996: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St . Petersburg Beach, Florida, USA , January 21-24, 1996. 271\u2013283. Yasuhiko Minamide, J.\u00a0Gregory Morrisett, and Robert Harper. 1996. Typed Closure Conversion. In Conference Record of POPL\u201996: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St. Petersburg Beach, Florida, USA, January 21-24, 1996. 271\u2013283."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268954"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341687"},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. ACM Program. Lang. 5, ICFP","author":"Paraskevopoulou Zoe","year":"2021","unstructured":"Zoe Paraskevopoulou , John\u00a0 M. Li , and Andrew\u00a0 W. Appel . 2021 . Compositional optimizations for CertiCoq . Proc. ACM Program. Lang. 5, ICFP (2021), 1\u201330. Zoe Paraskevopoulou, John\u00a0M. Li, and Andrew\u00a0W. Appel. 2021. Compositional optimizations for CertiCoq. Proc. ACM Program. Lang. 5, ICFP (2021), 1\u201330."},{"key":"e_1_3_2_2_20_1","volume-title":"5th ACM Conference","author":"L.","year":"1991","unstructured":"Simon\u00a0 L. Peyton Jones and John Launchbury. 1991. Unboxed Values as First Class Citizens in a Non-Strict Functional Language. In Functional Programming Languages and Computer Architecture , 5th ACM Conference , Cambridge, MA, USA , August 26-30, 1991 , Proceedings. 636\u2013666. Simon\u00a0L. Peyton Jones and John Launchbury. 1991. Unboxed Values as First Class Citizens in a Non-Strict Functional Language. In Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings. 636\u2013666."},{"key":"e_1_3_2_2_21_1","first-page":"1","article-title":"A Transformation-Based Optimiser for","volume":"32","author":"Peyton Jones L.","year":"1998","unstructured":"Simon\u00a0 L. Peyton Jones and Andr\u00e9 L.\u00a0M. Santos . 1998 . A Transformation-Based Optimiser for Haskell. Sci. Comput. Program. 32 , 1 - 3 (1998), 3\u201347. Simon\u00a0L. Peyton Jones and Andr\u00e9 L.\u00a0M. Santos. 1998. A Transformation-Based Optimiser for Haskell. Sci. Comput. Program. 32, 1-3 (1998), 3\u201347.","journal-title":"Haskell. Sci. Comput. Program."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500003066"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(96)00012-3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345125"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/889478"},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM@POPL 2021","author":"Sullivan J.","year":"2021","unstructured":"Zachary\u00a0 J. Sullivan , Paul Downen , and Zena\u00a0 M. Ariola . 2021 . Strictly capturing non-strict closures . In Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM@POPL 2021 , Virtual Event, Denmark , January 18-19, 2021. ACM, 74\u201389. Zachary\u00a0J. Sullivan, Paul Downen, and Zena\u00a0M. Ariola. 2021. Strictly capturing non-strict closures. In Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM@POPL 2021, Virtual Event, Denmark, January 18-19, 2021. ACM, 74\u201389."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178044"}],"event":{"name":"PPDP 2023: International Symposium on Principles and Practice of Declarative Programming","location":"Lisboa Portugal","acronym":"PPDP 2023"},"container-title":["International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610622","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:00Z","timestamp":1750178160000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,22]]},"references-count":28,"alternative-id":["10.1145\/3610612.3610622","10.1145\/3610612"],"URL":"https:\/\/doi.org\/10.1145\/3610612.3610622","relation":{},"subject":[],"published":{"date-parts":[[2023,10,22]]},"assertion":[{"value":"2023-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}