{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:30:36Z","timestamp":1767929436367,"version":"3.49.0"},"reference-count":56,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470630","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T16:14:07Z","timestamp":1625674447000},"page":"1-14","source":"Crossref","is-referenced-by-count":11,"title":["Strong Call-by-Value is Reasonable, Implosively"],"prefix":"10.1109","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Condoluci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio Sacerdoti","family":"Coen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3371095"},{"key":"ref38","first-page":"502","article-title":"The essence of compiling with continuations (with retrospective)","author":"flanagan","year":"0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(3:12)2012"},{"key":"ref32","first-page":"100","article-title":"Derivational complexity is an invariant cost model","author":"dal lago","year":"2009","journal-title":"Foundational and Practical Aspects of Resource Analysis - First International Workshop FOPARA 2009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.044"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351262"},{"key":"ref37","first-page":"186","article-title":"Böhm trees, Krivine's machine and the Taylor expansion of lambda-terms","author":"ehrhard","year":"2006","journal-title":"Logical Approaches to Computational Barriers Second Conference on Computability in Europe CiE 2006"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129516000396"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505898"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.7146\/brics.v11i26.21851"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354174"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54830-7_7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9015-z"},{"key":"ref2","first-page":"1","article-title":"The complexity of abstract machines","volume":"235","author":"accattoli","year":"2016","journal-title":"WPTE FSCD ser EPTCS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.08.006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3110264"},{"key":"ref22","first-page":"147","article-title":"An abstract machine for strong call by value","author":"biernacka","year":"2020","journal-title":"Programming Languages and Systems - 18th Asian Symposium APLAS 2020"},{"key":"ref21","article-title":"Auto-validation d'un système de preuves avec familles inductives","author":"barras","year":"1999","journal-title":"Ph D Dissertation"},{"key":"ref24","article-title":"Strong call by value is reasonable for time","author":"biernacka","year":"2021","journal-title":"CoRR"},{"key":"ref23","first-page":"8:1","article-title":"Deriving an abstract machine for strong call by need","author":"biernacka","year":"2019","journal-title":"4th International Conference on Formal Structures for Computation and Deduction FSCD 2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224210"},{"key":"ref25","first-page":"10:1","article-title":"Generalized refocusing: From hybrid strategies to abstract machines","author":"biernacka","year":"2017","journal-title":"2nd International Conference on Formal Structures for Computation and Deduction FSCD 2017"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"ref51","author":"ronchi della rocca","year":"2004","journal-title":"The Parametric ?-Calculus – A Metamodel for Computation ser Texts in Theoretical Computer Science"},{"key":"ref56","article-title":"Semantics and pragmatics of the lambda-calculus","author":"wadsworth","year":"1971","journal-title":"PhD thesis"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808705"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36377-7_4"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.050"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2019.03.002"},{"key":"ref11","article-title":"Semantic bounds and strong call-by-value normalization","author":"accattoli","year":"2021","journal-title":"CoRR"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796819000017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29822-6_4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.23"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ic.2017.01.003","article-title":"On the value of variables","volume":"255","author":"accattoli","year":"2017","journal-title":"Information and Computation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/888251.888254"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002724"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199507"},{"key":"ref18","author":"asperti","year":"1998","journal-title":"The optimal implementation of functional programming languages"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2869"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628154"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52921-8_1"},{"key":"ref6","article-title":"Strong call-by-value is reasonable, implosively","author":"accattoli","year":"2021","journal-title":"CoRR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3131851.3131855"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-12(1:4)2016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354169"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999130"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47958-3_12"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003037"},{"key":"ref45","article-title":"Réductions correctes et optimales dans le lambda-calcul","author":"l\u00e9vy","year":"1978","journal-title":"Thése d'Etat"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45446-2_5"},{"key":"ref47","article-title":"The derivative of a regular type is its type of one-hole contexts (extended abstract)","author":"mcbride","year":"2001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002864"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581501"},{"key":"ref44","article-title":"The ZINC experiment: an economical implementation of the ML language","author":"leroy","year":"1990","journal-title":"Technical Report TR 117 INRIA"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49630-5_25"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Rome, Italy","start":{"date-parts":[[2021,6,29]]},"end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470630.pdf?arnumber=9470630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:46:22Z","timestamp":1652183182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470630","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}