{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:22:16Z","timestamp":1765617736889,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,10]]},"DOI":"10.1145\/3756907.3756922","type":"proceedings-article","created":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:19:11Z","timestamp":1765617551000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Closure Conversion, Flat Environments, and the Complexity of Abstract Machines"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4944-9944","authenticated-orcid":false,"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[{"name":"Inria & LIX, \u00c9cole Polytechnique, Palaiseau, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8828-8843","authenticated-orcid":false,"given":"Cl\u00e1udio","family":"Belo Louren\u00e7o","sequence":"additional","affiliation":[{"name":"Huawei Central Software Institute, Edinburgh, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4003-8893","authenticated-orcid":false,"given":"Dan","family":"R. Ghica","sequence":"additional","affiliation":[{"name":"Huawei Central Software Institute, Edinburgh, United Kingdom and University of Birmingham, Birmingham, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0469-4279","authenticated-orcid":false,"given":"Giulio","family":"Guerrieri","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4360-6016","authenticated-orcid":false,"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna, Bologna, Italy"}]}],"member":"320","published-online":{"date-parts":[[2025,12,13]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSCD.2019.1"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628154"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26529-2_13"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3131851.3131855"},{"key":"e_1_3_3_2_6_2","unstructured":"Beniamino Accattoli Cl\u00e1udio\u00a0Belo Louren\u00e7o Dan Ghica Giulio Guerrieri and Claudio\u00a0Sacerdoti Coen. 2025. Closure Conversion Flat Environments and the Complexity of Abstract Machines (Long Version). arxiv:https:\/\/arXiv.org\/abs\/2507.15843\u00a0[cs.PL] https:\/\/arxiv.org\/abs\/2507.15843"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354169"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470630"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Beniamino Accattoli and Ugo Dal\u00a0Lago. 2016. (Leftmost-Outermost) Beta-Reduction is Invariant Indeed. Logical Methods in Computer Science 12 1 (2016). 10.2168\/LMCS-12(1:4)2016","DOI":"10.2168\/LMCS-12(1:4)2016"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Beniamino Accattoli Ugo Dal\u00a0Lago and Gabriele Vanoni. 2021. The (In)Efficiency of Interaction. Proc. ACM Program. Lang. 5 POPL (2021) 1\u201333. 10.1145\/3434332","DOI":"10.1145\/3434332"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3531130.3533362"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47958-3_12"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68972-2_1"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Beniamino Accattoli and Giulio Guerrieri. 2019. Abstract machines for Open Call-by-Value. Sci. Comput. Program. 184 (2019). 10.1016\/j.scico.2019.03.002","DOI":"10.1016\/j.scico.2019.03.002"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Beniamino Accattoli and Claudio Sacerdoti\u00a0Coen. 2017. On the value of variables. Inf. Comput. 255 (2017) 224\u2013242. 10.1016\/j.ic.2017.01.003","DOI":"10.1016\/j.ic.2017.01.003"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/888251.888254"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411227"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75303"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192372"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706312"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354174"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.5555\/1795772"},{"key":"e_1_3_3_2_23_2","first-page":"193","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, Ebberup, Denmark, 25-28 August 1986","author":"Felleisen Matthias","year":"1987","unstructured":"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, Martin Wirsing (Ed.). North-Holland, 193\u2013222."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.ENTCS.2009.03.035"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581501"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2661103.2661106"},{"key":"e_1_3_3_2_27_2","volume-title":"The ZINC experiment: an economical implementation of the ML language","author":"Leroy Xavier","year":"1990","unstructured":"Xavier Leroy. 1990. The ZINC experiment: an economical implementation of the ML language. Technical report 117. INRIA. http:\/\/gallium.inria.fr\/\u00a0xleroy\/publi\/ZINC.pdf"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354181"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237791"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80702-9"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","unstructured":"J.\u00a0Gregory Morrisett David Walker Karl Crary and Neal Glew. 1999. From system F to typed assembly language. ACM Trans. Program. Lang. Syst. 21 3 (1999) 527\u2013568. 10.1145\/319301.319345","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Zoe Paraskevopoulou and Andrew\u00a0W. Appel. 2019. Closure conversion is safe for space. Proc. ACM Program. Lang. 3 ICFP (2019) 83:1\u201383:29. 10.1145\/3341687","DOI":"10.1145\/3341687"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","unstructured":"Gordon\u00a0D. Plotkin. 1975. Call-by-Name Call-by-Value and the lambda-Calculus. Theor. Comput. Sci. 1 2 (1975) 125\u2013159. 10.1016\/0304-3975(75)90017-1","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_3_3_2_34_2","unstructured":"Claudio Sacerdoti\u00a0Coen. 2025. Artifact for the Closure Conversion and Abstract Machines paper. https:\/\/github.com\/sacerdot\/closure-conversion-machine\/releases\/tag\/PPDP25."},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80090-2"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/182409.156783"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","unstructured":"Zhong Shao and Andrew\u00a0W. Appel. 2000. Efficient and safe-for-space closure conversion. ACM Trans. Program. Lang. Syst. 22 1 (2000) 129\u2013161. 10.1145\/345099.345125","DOI":"10.1145\/345099.345125"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3441296.3441398"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3610612.3610622"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178044"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_29"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Andrew\u00a0K. Wright and Matthias Felleisen. 1994. A Syntactic Approach to Type Soundness. Inf. Comput. 115 1 (1994) 38\u201394. 10.1006\/INCO.1994.1093","DOI":"10.1006\/INCO.1994.1093"}],"event":{"name":"PPDP '25: Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming","location":"Rende Italy","acronym":"PPDP '25"},"container-title":["Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3756907.3756922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:19:35Z","timestamp":1765617575000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3756907.3756922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,10]]},"references-count":41,"alternative-id":["10.1145\/3756907.3756922","10.1145\/3756907"],"URL":"https:\/\/doi.org\/10.1145\/3756907.3756922","relation":{},"subject":[],"published":{"date-parts":[[2025,9,10]]},"assertion":[{"value":"2025-12-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}