{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:13:45Z","timestamp":1768162425605,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032159809","type":"print"},{"value":"9783032159816","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15981-6_2","type":"book-chapter","created":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:35Z","timestamp":1768151615000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A One-Pass CPS Transform with\u00a0Simulation on\u00a0the\u00a0Nose"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9371-3467","authenticated-orcid":false,"given":"Pascal Y.","family":"Lasnier","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1650-6340","authenticated-orcid":false,"given":"Jeremy","family":"Yallop","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9504-4107","authenticated-orcid":false,"given":"Magnus O.","family":"Myreen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declaritive Programming, PPDP 2003, pp. 8\u201319. Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/888251.888254","DOI":"10.1145\/888251.888254"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Baker, H.G.: Cons should not cons its arguments, part ii: Cheney on the M.T.A. SIGPLAN Not. 30(9), 17\u201320 (1995). https:\/\/doi.org\/10.1145\/214448.214454","DOI":"10.1145\/214448.214454"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Chlipala, A.: Parametric higher-order abstract syntax for mechanized semantics. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, pp. 143\u2013156. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1411204.1411226","DOI":"10.1145\/1411204.1411226"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing control: a study of the CPS transformation. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992). https:\/\/doi.org\/10.1017\/S0960129500001535","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR5","unstructured":"Danvy, O.: On evaluation contexts, continuations, and the rest of computation (2004)"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Danvy, O.: Defunctionalized interpreters for programming languages. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, pp. 131\u2013142. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1411204.1411206","DOI":"10.1145\/1411204.1411206"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Kahn, G. (ed.) Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990, Nice, France, 27\u201329 June 1990, pp. 151\u2013160. ACM (1990). https:\/\/doi.org\/10.1145\/91556.91622","DOI":"10.1145\/91556.91622"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: Proceedings of the 3rd ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2001, pp. 162\u2013174. Association for Computing Machinery, New York (2001). https:\/\/doi.org\/10.1145\/773184.773202","DOI":"10.1145\/773184.773202"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-3975(02)00733-8","volume":"308","author":"O Danvy","year":"2003","unstructured":"Danvy, O., Nielsen, L.R.: A first-order one-pass CPS transformation. Theoret. Comput. Sci. 308(1), 239\u2013257 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00733-8","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-75560-9_17","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Z Dargaye","year":"2007","unstructured":"Dargaye, Z., Leroy, X.: Mechanized verification of CPS transformations. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 211\u2013225. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_17"},{"key":"2_CR11","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the $$\\lambda $$-calculus. In: Formal Description of Programming Concepts (1987). https:\/\/api.semanticscholar.org\/CorpusID:57760323"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Kelsey, R.A.: A correspondence between continuation passing style and static single assignment form. In: Papers from the 1995 ACM SIGPLAN Workshop on Intermediate Representations, IR 1995, pp. 13\u201322. Association for Computing Machinery, New York (1995). https:\/\/doi.org\/10.1145\/202529.202532","DOI":"10.1145\/202529.202532"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J., Adams, N.: Orbit: an optimizing compiler for Scheme. In: Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, SIGPLAN 1986, pp. 219\u2013233. Association for Computing Machinery, New York (1986). https:\/\/doi.org\/10.1145\/12276.13333","DOI":"10.1145\/12276.13333"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lasnier, P.Y., Yallop, J., Myreen, M.O.: Brack: a verified compiler for Scheme via CakeML. In: Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2026. Association for Computing Machinery, New York (2026)","DOI":"10.1145\/3779031.3779098"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Minamide, Y., Okuma, K.: Verifying CPS transformations in Isabelle\/HOL. In: Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003, pp. 1\u20138. Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/976571.976576","DOI":"10.1145\/976571.976576"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Paraskevopoulou, Z., Grover, A.: Compiling with continuations, correctly. Proc. ACM Program. Lang. 5(OOPSLA) (2021). https:\/\/doi.org\/10.1145\/3485491","DOI":"10.1145\/3485491"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"AM Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165\u2013193 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00138-X","journal-title":"Inf. Comput."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G Plotkin","year":"1975","unstructured":"Plotkin, G.: Call-by-name, call-by-value and the $$\\lambda $$-calculus. Theoret. Comput. Sci. 1(2), 125\u2013159 (1975). https:\/\/doi.org\/10.1016\/0304-3975(75)90017-1","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR19","unstructured":"Pottier, F.: Revisiting the CPS transformation and its implementation (2006)"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of the ACM Annual Conference, ACM 1972, vol. 2, pp. 717\u2013740. Association for Computing Machinery, New York (1972). https:\/\/doi.org\/10.1145\/800194.805852","DOI":"10.1145\/800194.805852"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. In: Proceedings of the 1992 ACM Conference on LISP and Functional Programming, LFP 1992, pp. 288\u2013298. Association for Computing Machinery, New York (1992). https:\/\/doi.org\/10.1145\/141471.141563","DOI":"10.1145\/141471.141563"},{"key":"2_CR22","unstructured":"Steele, G.L.: Rabbit: a compiler for Scheme. Technical report, USA (1978)"},{"key":"2_CR23","unstructured":"Tian, Y.H.: Mechanically verifying correctness of CPS compilation. In: Proceedings of the Twelfth Computing: The Australasian Theory Symposium, CATS 2006, vol. 51, pp. 41\u201351. Australian Computer Society, Inc. (2006)"},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1014408032446","volume":"14","author":"Y Xiao","year":"2001","unstructured":"Xiao, Y., Sabry, A., Ariola, Z.M.: From syntactic theories to interpreters: automating the proof of unique decomposition. High. Order Symb. Comput. 14(4), 387\u2013409 (2001). https:\/\/doi.org\/10.1023\/A:1014408032446","journal-title":"High. Order Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15981-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:46Z","timestamp":1768151626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15981-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032159809","9783032159816"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15981-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl26.sigplan.org\/home\/PADL-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}