{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:13Z","timestamp":1773478993263,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:00:00Z","timestamp":1570406400000},"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":[[2019,10,7]]},"DOI":"10.1145\/3354166.3354169","type":"proceedings-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T12:58:36Z","timestamp":1569329916000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Crumbling Abstract Machines"],"prefix":"10.1145","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[{"name":"LIX, Inria & \u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Condoluci","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Guerrieri","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Bath, Bath, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio Sacerdoti","family":"Coen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications, RTA 2012 (LIPIcs)","volume":"15","author":"Accattoli Beniamino","year":"2012","unstructured":"Beniamino Accattoli . 2012 . An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications, RTA 2012 (LIPIcs) , Vol. 15 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 6--21. https:\/\/doi.org\/10.4230\/LIPIcs.RTA. 2012.6 10.4230\/LIPIcs.RTA.2012.6 Beniamino Accattoli. 2012. An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications, RTA 2012 (LIPIcs), Vol. 15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 6--21. https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2012.6"},{"key":"e_1_3_2_1_2_1","volume-title":"WoLLIC 2016 (Lecture Notes in Computer Science)","volume":"9803","author":"Accattoli Beniamino","year":"2016","unstructured":"Beniamino Accattoli . 2016 . The Useful MAM, a Reasonable Implementation of the Strong \u03bb-Calculus. In Logic, Language, Information, and Computation - 23rd International Workshop , WoLLIC 2016 (Lecture Notes in Computer Science) , Vol. 9803 . Springer, 1--21. https:\/\/doi.org\/10.1007\/978-3-662-52921-8_1 10.1007\/978-3-662-52921-8_1 Beniamino Accattoli. 2016. The Useful MAM, a Reasonable Implementation of the Strong \u03bb-Calculus. In Logic, Language, Information, and Computation - 23rd International Workshop, WoLLIC 2016 (Lecture Notes in Computer Science), Vol. 9803. Springer, 1--21. https:\/\/doi.org\/10.1007\/978-3-662-52921-8_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628154"},{"key":"e_1_3_2_1_4_1","volume-title":"APLAS 2015 (Lecture Notes in Computer Science)","volume":"9458","author":"Accattoli Beniamino","year":"2015","unstructured":"Beniamino Accattoli , Pablo Barenbaum , and Damiano Mazza . 2015 . A Strong Distillery. In Programming Languages and Systems - 13th Asian Symposium , APLAS 2015 (Lecture Notes in Computer Science) , Vol. 9458 . Springer, 231--250. https:\/\/doi.org\/10.1007\/978-3-319-26529-2_13 10.1007\/978-3-319-26529-2_13 Beniamino Accattoli, Pablo Barenbaum, and Damiano Mazza. 2015. A Strong Distillery. In Programming Languages and Systems - 13th Asian Symposium, APLAS 2015 (Lecture Notes in Computer Science), Vol. 9458. Springer, 231--250. https:\/\/doi.org\/10.1007\/978-3-319-26529-2_13"},{"key":"e_1_3_2_1_5_1","volume-title":"Environments and the Complexity of Abstract Machines. In 19th International Symposium on Principles and Practice of Declarative Programming, PPDP 2017","author":"Accattoli Beniamino","year":"2017","unstructured":"Beniamino Accattoli and Bruno Barras . 2017 . Environments and the Complexity of Abstract Machines. In 19th International Symposium on Principles and Practice of Declarative Programming, PPDP 2017 . ACM, 4--16. https:\/\/doi.org\/10.1145\/3131851.3131855 10.1145\/3131851.3131855 Beniamino Accattoli and Bruno Barras. 2017. Environments and the Complexity of Abstract Machines. In 19th International Symposium on Principles and Practice of Declarative Programming, PPDP 2017. ACM, 4--16. https:\/\/doi.org\/10.1145\/3131851.3131855"},{"key":"e_1_3_2_1_6_1","volume-title":"Crumbling Abstract Machines (Extended Version). CoRR abs\/1907.06057","author":"Accattoli Beniamino","year":"2019","unstructured":"Beniamino Accattoli , Andrea Condoluci , Giulio Guerrieri , and Claudio Sacerdoti Coen . 2019. Crumbling Abstract Machines (Extended Version). CoRR abs\/1907.06057 ( 2019 ). Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, and Claudio Sacerdoti Coen. 2019. Crumbling Abstract Machines (Extended Version). CoRR abs\/1907.06057 (2019)."},{"key":"e_1_3_2_1_7_1","volume-title":"Logical Methods in Computer Science 12, 1","author":"Accattoli Beniamino","year":"2016","unstructured":"Beniamino Accattoli and Ugo Dal Lago . 2016. (Leftmost-Outermost) Beta Reduction is Invariant , Indeed. Logical Methods in Computer Science 12, 1 ( 2016 ). https:\/\/doi.org\/10.2168\/LMCS-12(1:4)2016 10.2168\/LMCS-12(1:4)2016 Beniamino Accattoli and Ugo Dal Lago. 2016. (Leftmost-Outermost) Beta Reduction is Invariant, Indeed. Logical Methods in Computer Science 12, 1 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(1:4)2016"},{"key":"e_1_3_2_1_8_1","volume-title":"APLAS 2016 (Lecture Notes in Computer Science)","volume":"10017","author":"Accattoli Beniamino","year":"2016","unstructured":"Beniamino Accattoli and Giulio Guerrieri . 2016 . Open Call-by-Value. In Programming Languages and Systems - 14th Asian Symposium , APLAS 2016 (Lecture Notes in Computer Science) , Vol. 10017 . Springer, 206--226. https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12 10.1007\/978-3-319-47958-3_12 Beniamino Accattoli and Giulio Guerrieri. 2016. Open Call-by-Value. In Programming Languages and Systems - 14th Asian Symposium, APLAS 2016 (Lecture Notes in Computer Science), Vol. 10017. Springer, 206--226. https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12"},{"key":"e_1_3_2_1_9_1","volume-title":"FSEN 2017 (Lecture Notes in Computer Science)","volume":"10522","author":"Accattoli Beniamino","year":"2017","unstructured":"Beniamino Accattoli and Giulio Guerrieri . 2017 . Implementing Open Call-by-Value. In Fundamentals of Software Engineering - 7th International Conference , FSEN 2017 (Lecture Notes in Computer Science) , Vol. 10522 . Springer, 1--19. https:\/\/doi.org\/10.1007\/978-3-319-68972-2_1 10.1007\/978-3-319-68972-2_1 Beniamino Accattoli and Giulio Guerrieri. 2017. Implementing Open Call-by-Value. In Fundamentals of Software Engineering - 7th International Conference, FSEN 2017 (Lecture Notes in Computer Science), Vol. 10522. Springer, 1--19. https:\/\/doi.org\/10.1007\/978-3-319-68972-2_1"},{"key":"e_1_3_2_1_10_1","volume-title":"APLAS 2018 (Lecture Notes in Computer Science)","volume":"11275","author":"Accattoli Beniamino","year":"2018","unstructured":"Beniamino Accattoli and Giulio Guerrieri . 2018 . Types of Fireballs. In Programming Languages and Systems - 16th Asian Symposium , APLAS 2018 (Lecture Notes in Computer Science) , Vol. 11275 . Springer, 45--66. https:\/\/doi.org\/10.1007\/978-3-030-02768-1_3 10.1007\/978-3-030-02768-1_3 Beniamino Accattoli and Giulio Guerrieri. 2018. Types of Fireballs. In Programming Languages and Systems - 16th Asian Symposium, APLAS 2018 (Lecture Notes in Computer Science), Vol. 11275. Springer, 45--66. https:\/\/doi.org\/10.1007\/978-3-030-02768-1_3"},{"key":"e_1_3_2_1_11_1","volume-title":"On the Relative Usefulness of Fireballs. In 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015","author":"Accattoli Beniamino","year":"2015","unstructured":"Beniamino Accattoli and Claudio Sacerdoti Coen . 2015 . On the Relative Usefulness of Fireballs. In 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015 . IEEE Computer Society, 141--155. https:\/\/doi.org\/10.1109\/LICS. 2015.23 10.1109\/LICS.2015.23 Beniamino Accattoli and Claudio Sacerdoti Coen. 2015. On the Relative Usefulness of Fireballs. In 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015. IEEE Computer Society, 141--155. https:\/\/doi.org\/10.1109\/LICS.2015.23"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.01.003"},{"key":"e_1_3_2_1_13_1","volume-title":"The Call-by-Need Lambda Calculus. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'95","author":"Ariola Zena M.","year":"1995","unstructured":"Zena M. Ariola , Matthias Felleisen , John Maraist , Martin Odersky , and Philip Wadler . 1995 . The Call-by-Need Lambda Calculus. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'95 . ACM Press, 233--246. https:\/\/doi.org\/10.1145\/ 199448.199507 10.1145\/199448.199507 Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, and Philip Wadler. 1995. The Call-by-Need Lambda Calculus. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'95. ACM Press, 233--246. https:\/\/doi.org\/10.1145\/199448.199507"},{"key":"#cr-split#-e_1_3_2_1_14_1.1","doi-asserted-by":"crossref","unstructured":"Pierre Cr\u00e9gut. 1990. An Abstract Machine for Lambda-Terms Normalization. In LISP and Functional Programming. 333--340. https:\/\/doi.org\/10.1145\/91556.91681 10.1145\/91556.91681","DOI":"10.1145\/91556.91681"},{"key":"#cr-split#-e_1_3_2_1_14_1.2","doi-asserted-by":"crossref","unstructured":"Pierre Cr\u00e9gut. 1990. An Abstract Machine for Lambda-Terms Normalization. In LISP and Functional Programming. 333--340. https:\/\/doi.org\/10.1145\/91556.91681","DOI":"10.1145\/91556.91681"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00003-4"},{"key":"e_1_3_2_1_16_1","volume-title":"12th International Conference, CC 2003 (Lecture Notes in Computer Science)","volume":"2622","author":"Danvy Olivier","year":"2003","unstructured":"Olivier Danvy . 2003 . A New One-Pass Transformation into Monadic Normal Form. In Compiler Construction , 12th International Conference, CC 2003 (Lecture Notes in Computer Science) , Vol. 2622 . Springer, 77--89. https:\/\/doi.org\/10.1007\/3-540-36579-6_6 10.1007\/3-540-36579-6_6 Olivier Danvy. 2003. A New One-Pass Transformation into Monadic Normal Form. In Compiler Construction, 12th International Conference, CC 2003 (Lecture Notes in Computer Science), Vol. 2622. Springer, 77--89. https:\/\/doi.org\/10.1007\/3-540-36579-6_6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001535"},{"key":"e_1_3_2_1_18_1","volume-title":"20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, PLDI 1993. ACM, 502--514","author":"Flanagan Cormac","year":"1993","unstructured":"Cormac Flanagan , Amr Sabry , Bruce F. Duba , and Matthias Felleisen . 1993 . The essence of compiling with continuations (with retrospective) . In 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, PLDI 1993. ACM, 502--514 . https:\/\/doi.org\/10.1145\/989393.989443 10.1145\/989393.989443 Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. 1993. The essence of compiling with continuations (with retrospective). In 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, PLDI 1993. ACM, 502--514. https:\/\/doi.org\/10.1145\/989393.989443"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505887"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581501"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.293.5"},{"key":"e_1_3_2_1_22_1","volume-title":"Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. Logical Methods in Computer Science 13, 4","author":"Guerrieri Giulio","year":"2017","unstructured":"Giulio Guerrieri , Luca Paolini , and Simona Ronchi Della Rocca . 2017. Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. Logical Methods in Computer Science 13, 4 ( 2017 ). https:\/\/doi.org\/10.23638\/LMCS-13(4:29)2017 10.23638\/LMCS-13(4:29)2017 Giulio Guerrieri, Luca Paolini, and Simona Ronchi Della Rocca. 2017. Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. Logical Methods in Computer Science 13, 4 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:29)2017"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178053"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291179"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289462"},{"key":"e_1_3_2_1_26_1","volume-title":"Eager Normal Form Bisimulation. In 20th IEEE Symposium on Logic in Computer Scienc, LICS 2005","author":"Lassen S\u00f8ren B.","year":"2005","unstructured":"S\u00f8ren B. Lassen . 2005 . Eager Normal Form Bisimulation. In 20th IEEE Symposium on Logic in Computer Scienc, LICS 2005 . IEEE Computer Society, 345--354. https:\/\/doi.org\/10.1109\/LICS. 2005.15 10.1109\/LICS.2005.15 S\u00f8ren B. Lassen. 2005. Eager Normal Form Bisimulation. In 20th IEEE Symposium on Logic in Computer Scienc, LICS 2005. IEEE Computer Society, 345--354. https:\/\/doi.org\/10.1109\/LICS.2005.15"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003037"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_30_1","first-page":"507","article-title":"Call-by-value Solvability","volume":"33","author":"Paolini Luca","year":"1999","unstructured":"Luca Paolini and Simona Ronchi Della Rocca . 1999 . Call-by-value Solvability . ITA 33 , 6 (1999), 507 -- 534 . https:\/\/doi.org\/10.1051\/ita:1999130 10.1051\/ita:1999130 Luca Paolini and Simona Ronchi Della Rocca. 1999. Call-by-value Solvability. ITA 33, 6 (1999), 507--534. https:\/\/doi.org\/10.1051\/ita:1999130","journal-title":"ITA"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_3_2_1_32_1","volume-title":"The Parametric \u03bb-Calculus - A Metamodel for Computation","author":"Della Rocca Simona Ronchi","unstructured":"Simona Ronchi Della Rocca and Luca Paolini . 2004. The Parametric \u03bb-Calculus - A Metamodel for Computation . Springer . https:\/\/doi.org\/10.1007\/978-3-662-10394-4 10.1007\/978-3-662-10394-4 Simona Ronchi Della Rocca and Luca Paolini. 2004. The Parametric \u03bb-Calculus - A Metamodel for Computation. Springer. https:\/\/doi.org\/10.1007\/978-3-662-10394-4"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"}],"event":{"name":"PPDP '19: Principles and Practice of Programming Languages 2019","location":"Porto Portugal","acronym":"PPDP '19","sponsor":["Sony Sony Corporation"]},"container-title":["Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3354166.3354169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3354166.3354169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:56Z","timestamp":1750203896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3354166.3354169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,7]]},"references-count":35,"alternative-id":["10.1145\/3354166.3354169","10.1145\/3354166"],"URL":"https:\/\/doi.org\/10.1145\/3354166.3354169","relation":{},"subject":[],"published":{"date-parts":[[2019,10,7]]},"assertion":[{"value":"2019-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}