{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:10Z","timestamp":1773478990333,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T00:00:00Z","timestamp":1507507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR JCJC","award":["COCA HOLA (ANR-16-CE40-004-01)"],"award-info":[{"award-number":["COCA HOLA (ANR-16-CE40-004-01)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,9]]},"DOI":"10.1145\/3131851.3131855","type":"proceedings-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:51:09Z","timestamp":1507812669000},"page":"4-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Environments and the complexity of abstract machines"],"prefix":"10.1145","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[{"name":"INRIA, \u00c9cole Polytechnique"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Barras","sequence":"additional","affiliation":[{"name":"INRIA, \u00c9cole Polytechnique"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Beniamino Accattoli. 2016. COCA HOLA. https:\/\/sites.google.com\/site\/beniaminoaccattoli\/coca-hola. (2016).  Beniamino Accattoli. 2016. COCA HOLA. https:\/\/sites.google.com\/site\/beniaminoaccattoli\/coca-hola. (2016)."},{"key":"e_1_3_2_1_2_1","volume-title":"WPTE@FSCD","author":"Accattoli Beniamino","year":"2016","unstructured":"Beniamino Accattoli . 2016. The Complexity of Abstract Machines . In WPTE@FSCD 2016 . 1--15. Beniamino Accattoli. 2016. The Complexity of Abstract Machines. In WPTE@FSCD 2016. 1--15."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52921-8_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628154"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26529-2_13"},{"key":"e_1_3_2_1_6_1","volume-title":"The Negligible and Yet Subtle Cost of Pattern Matching. Accepted to APLAS","author":"Accattoli Beniamino","year":"2017","unstructured":"Beniamino Accattoli and Bruno Barras . 2017. The Negligible and Yet Subtle Cost of Pattern Matching. Accepted to APLAS 2017 . (2017). Beniamino Accattoli and Bruno Barras. 2017. The Negligible and Yet Subtle Cost of Pattern Matching. Accepted to APLAS 2017. (2017)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.23"},{"key":"e_1_3_2_1_8_1","volume-title":"On the Invariance of the Unitary Cost Model for Head Reduction. In RTA","author":"Accattoli Beniamino","year":"2012","unstructured":"Beniamino Accattoli and Ugo Dal Lago . 2012 . On the Invariance of the Unitary Cost Model for Head Reduction. In RTA 2012. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 22--37. Beniamino Accattoli and Ugo Dal Lago. 2012. On the Invariance of the Unitary Cost Model for Head Reduction. In RTA 2012. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 22--37."},{"key":"e_1_3_2_1_9_1","volume-title":"Implementing Open Call-by-Value. Accepted at FSEN","author":"Accattoli Beniamino","year":"2017","unstructured":"Beniamino Accattoli and Giulio Guerrieri . 2017. Implementing Open Call-by-Value. Accepted at FSEN 2017 . (2017). Beniamino Accattoli and Giulio Guerrieri. 2017. Implementing Open Call-by-Value. Accepted at FSEN 2017. (2017)."},{"key":"e_1_3_2_1_10_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 ). Beniamino Accattoli and Ugo Dal Lago. 2016. (Leftmost-Outermost) Beta Reduction is Invariant, Indeed. Logical Methods in Computer Science 12, 1 (2016)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44145-9_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.02.012"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516507.1516508"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002724"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110264"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224210"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_7"},{"key":"e_1_3_2_1_19_1","unstructured":"Coq Development Team. 2016. The Coq Proof-Assistant Reference Manual version 8.6. (2016). http:\/\/coq.inria.fr  Coq Development Team. 2016. The Coq Proof-Assistant Reference Manual version 8.6. (2016). http:\/\/coq.inria.fr"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9015-z"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505898"},{"key":"e_1_3_2_1_23_1","volume-title":"3rd Working Conference on the Formal Description of Programming Concepts.","author":"Felleisen Matthias","unstructured":"Matthias Felleisen and Daniel P. Friedman . 1986. Control operators, the SECD-machine, and the lambda-calculus . In 3rd Working Conference on the Formal Description of Programming Concepts. Matthias Felleisen and Daniel P. Friedman. 1986. Control operators, the SECD-machine, and the lambda-calculus. In 3rd Working Conference on the Formal Description of Programming Concepts."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.03.035"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9014-0"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480903"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581501"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898002986"},{"key":"e_1_3_2_1_29_1","first-page":"2","article-title":"Computing with Capsules","volume":"17","author":"Jeannin Jean-Baptiste","year":"2012","unstructured":"Jean-Baptiste Jeannin and Dexter Kozen . 2012 . Computing with Capsules . Journal of Automata, Languages and Combinatorics 17 , 2 -- 4 (2012), 185--204. Jean-Baptiste Jeannin and Dexter Kozen. 2012. Computing with Capsules. Journal of Automata, Languages and Combinatorics 17, 2--4 (2012), 185--204.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_33_1","unstructured":"Xavier Leroy. 1990. The ZINC experiment: an economical implementation of the ML language. Technical report 117. INRIA. http:\/\/gallium.inria.fr\/~xleroy\/publi\/ZINC.pdf  Xavier Leroy. 1990. The ZINC experiment: an economical implementation of the ML language. Technical report 117. INRIA. http:\/\/gallium.inria.fr\/~xleroy\/publi\/ZINC.pdf"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003037"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224187"},{"key":"e_1_3_2_1_36_1","volume-title":"ESOP","author":"P\u00e9drot Pierre-Marie","year":"2016","unstructured":"Pierre-Marie P\u00e9drot and Alexis Saurin . 2016. Classical By-Need . In ESOP 2016 . Springer , 616--643. Pierre-Marie P\u00e9drot and Alexis Saurin. 2016. Classical By-Need. In ESOP 2016. Springer, 616--643."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_3_2_1_38_1","volume-title":"The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones","author":"Sands David","unstructured":"David Sands , J\u00f6rgen Gustavsson , and Andrew Moran . 2002. Lambda Calculi and Linear Speedups . In The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones . Springer , 60--84. David Sands, J\u00f6rgen Gustavsson, and Andrew Moran. 2002. Lambda Calculi and Linear Speedups. In The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones. Springer, 60--84."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9019-8"}],"event":{"name":"PPDP'17: 19th International Symposium on Principles and Practice of Declarative Programming","location":"Namur Belgium","acronym":"PPDP'17"},"container-title":["Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131851.3131855","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3131851.3131855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:59Z","timestamp":1750212839000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131851.3131855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,9]]},"references-count":38,"alternative-id":["10.1145\/3131851.3131855","10.1145\/3131851"],"URL":"https:\/\/doi.org\/10.1145\/3131851.3131855","relation":{},"subject":[],"published":{"date-parts":[[2017,10,9]]},"assertion":[{"value":"2017-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}