{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:02Z","timestamp":1750220402576,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2019\/33\/B\/ST6\/00289"],"award-info":[{"award-number":["2019\/33\/B\/ST6\/00289"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,9,6]]},"DOI":"10.1145\/3479394.3479399","type":"proceedings-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T22:23:02Z","timestamp":1633645382000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Reflecting\u00a0Stacked\u00a0Continuations in\u00a0a\u00a0Fine-Grained\u00a0Direct-Style\u00a0Reduction\u00a0Theory"],"prefix":"10.1145","author":[{"given":"Dariusz","family":"Biernacki","sequence":"first","affiliation":[{"name":"Institute of Computer Science, University of Wroc\u0142aw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateusz","family":"Pyzik","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Wroc\u0142aw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Sieczkowski","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Wroc\u0142aw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference)(LIPIcs, Vol.\u00a0167)","author":"Biernacki Dariusz","year":"2020","unstructured":"Dariusz Biernacki , Mateusz Pyzik , and Filip Sieczkowski . 2020 . A Reflection on Continuation-Composing Style . In 5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference)(LIPIcs, Vol.\u00a0167) , Zena\u00a0M. Ariola (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 18:1\u201318:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD. 2020.18 10.4230\/LIPIcs.FSCD.2020.18 Dariusz Biernacki, Mateusz Pyzik, and Filip Sieczkowski. 2020. A Reflection on Continuation-Composing Style. In 5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference)(LIPIcs, Vol.\u00a0167), Zena\u00a0M. Ariola (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 18:1\u201318:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2020.18"},{"key":"e_1_3_2_1_2_1","volume-title":"Abstracting Control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990","author":"Danvy Olivier","year":"1990","unstructured":"Olivier Danvy and Andrzej Filinski . 1990 . Abstracting Control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990 , Nice, France , 27-29 June 1990. ACM, 151\u2013160. https:\/\/doi.org\/10.1145\/91556.91622 10.1145\/91556.91622 Olivier Danvy and Andrzej Filinski. 1990. Abstracting Control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990, Nice, France, 27-29 June 1990. ACM, 151\u2013160. https:\/\/doi.org\/10.1145\/91556.91622"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001535"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628147"},{"key":"e_1_3_2_1_5_1","volume-title":"The Theory and Practice of First-Class Prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages","author":"Felleisen Matthias","year":"1988","unstructured":"Matthias Felleisen . 1988 . The Theory and Practice of First-Class Prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages , San Diego, California, USA , January 10-13, 1988, Jeanne Ferranteand P.\u00a0Mager (Eds.). ACM Press, 180\u2013190. https:\/\/doi.org\/10.1145\/73560.73576 10.1145\/73560.73576 Matthias Felleisen. 1988. The Theory and Practice of First-Class Prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, California, USA, January 10-13, 1988, Jeanne Ferranteand P.\u00a0Mager (Eds.). ACM Press, 180\u2013190. https:\/\/doi.org\/10.1145\/73560.73576"},{"key":"e_1_3_2_1_6_1","volume-title":"Representing Monads. In Conference Record of POPL\u201994: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"Filinski Andrzej","year":"1994","unstructured":"Andrzej Filinski . 1994 . Representing Monads. In Conference Record of POPL\u201994: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , Portland, Oregon, USA , January 17-21, 1994, Hans-Juergen Boehm, Bernard Lang, and Daniel\u00a0M. Yellin(Eds.). ACM Press, 446\u2013457. https:\/\/doi.org\/10.1145\/174675.178047 10.1145\/174675.178047 Andrzej Filinski. 1994. Representing Monads. In Conference Record of POPL\u201994: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, USA, January 17-21, 1994, Hans-Juergen Boehm, Bernard Lang, and Daniel\u00a0M. Yellin(Eds.). ACM Press, 446\u2013457. https:\/\/doi.org\/10.1145\/174675.178047"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292557"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"e15","DOI":"10.1017\/S0956796819000121","article-title":"On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control","volume":"29","author":"Forster Yannick","year":"2019","unstructured":"Yannick Forster , Ohad Kammar , Sam Lindley , and Matija Pretnar . 2019 . On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control . J. Funct. Program. 29 (2019), e15 . https:\/\/doi.org\/10.1017\/S0956796819000121 10.1017\/S0956796819000121 Yannick Forster, Ohad Kammar, Sam Lindley, and Matija Pretnar. 2019. On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control. J. Funct. Program. 29(2019), e15. https:\/\/doi.org\/10.1017\/S0956796819000121","journal-title":"J. Funct. Program."},{"key":"e_1_3_2_1_9_1","volume-title":"Literal Movement Grammars. In EACL 1995, 7th Conference of the European Chapter of the Association for Computational Linguistics","author":"Groenink Annius","year":"1995","unstructured":"Annius Groenink . 1995 . Literal Movement Grammars. In EACL 1995, 7th Conference of the European Chapter of the Association for Computational Linguistics , March 27-31, 1995, University College Dublin, Belfield, Dublin, Ireland, Steven\u00a0P. Abney and Erhard\u00a0W. Hinrichs (Eds.). The Association for Computer Linguistics, 90\u201397. Annius Groenink. 1995. Literal Movement Grammars. In EACL 1995, 7th Conference of the European Chapter of the Association for Computational Linguistics, March 27-31, 1995, University College Dublin, Belfield, Dublin, Ireland, Steven\u00a0P. Abney and Erhard\u00a0W. Hinrichs (Eds.). The Association for Computer Linguistics, 90\u201397."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000040"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10990-007-9009-x","article-title":"Axioms for control operators in the CPS hierarchy","volume":"20","author":"Kameyama Yukiyoshi","year":"2007","unstructured":"Yukiyoshi Kameyama . 2007 . Axioms for control operators in the CPS hierarchy . High. Order Symb. Comput. 20 , 4 (2007), 339 \u2013 369 . https:\/\/doi.org\/10.1007\/s10990-007-9009-x 10.1007\/s10990-007-9009-x Yukiyoshi Kameyama. 2007. Axioms for control operators in the CPS hierarchy. High. Order Symb. Comput. 20, 4 (2007), 339\u2013369. https:\/\/doi.org\/10.1007\/s10990-007-9009-x","journal-title":"High. Order Symb. Comput."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003","author":"Kameyama Yukiyoshi","year":"2003","unstructured":"Yukiyoshi Kameyama and Masahito Hasegawa . 2003 . A sound and complete axiomatization of delimited continuations . In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003 , Uppsala, Sweden , August 25-29, 2003, Colin Runciman and Olin Shivers (Eds.). ACM, 177\u2013188. https:\/\/doi.org\/10.1145\/944705.944722 10.1145\/944705.944722 Yukiyoshi Kameyama and Masahito Hasegawa. 2003. A sound and complete axiomatization of delimited continuations. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003, Colin Runciman and Olin Shivers (Eds.). ACM, 177\u2013188. https:\/\/doi.org\/10.1145\/944705.944722"},{"key":"e_1_3_2_1_13_1","volume-title":"8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04583)","author":"Kiselyov Oleg","year":"2007","unstructured":"Oleg Kiselyov and Chung-chieh Shan. 2007 . A Substructural Type System for Delimited Continuations. In Typed Lambda Calculi and Applications , 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04583) , Simona Ronchi\u00a0Della Rocca (Ed.). Springer, 223\u2013239. https:\/\/doi.org\/10.1007\/978-3-540-73228-0_17 10.1007\/978-3-540-73228-0_17 Oleg Kiselyov and Chung-chieh Shan. 2007. A Substructural Type System for Delimited Continuations. In Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04583), Simona Ronchi\u00a0Della Rocca (Ed.). Springer, 223\u2013239. https:\/\/doi.org\/10.1007\/978-3-540-73228-0_17"},{"key":"e_1_3_2_1_14_1","volume-title":"CSL 2013","author":"Materzok Marek","year":"2013","unstructured":"Marek Materzok . 2013 . Axiomatizing Subtyped Delimited Continuations. In Computer Science Logic 2013 (CSL 2013) , CSL 2013 , September 2-5, 2013, Torino, Italy(LIPIcs, Vol.\u00a023), Simona Ronchi\u00a0Della Rocca (Ed.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 521\u2013539. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2013.521 10.4230\/LIPIcs.CSL.2013.521 Marek Materzok. 2013. Axiomatizing Subtyped Delimited Continuations. In Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy(LIPIcs, Vol.\u00a023), Simona Ronchi\u00a0Della Rocca (Ed.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 521\u2013539. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.521"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011","author":"Materzok Marek","year":"2011","unstructured":"Marek Materzok and Dariusz Biernacki . 2011 . Subtyping delimited continuations . In Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011 , Tokyo, Japan , September 19-21, 2011, Manuel M.\u00a0T. Chakravarty, Zhenjiang Hu, and Olivier Danvy (Eds.). ACM, 81\u201393. https:\/\/doi.org\/10.1145\/2034773.2034786 10.1145\/2034773.2034786 Marek Materzok and Dariusz Biernacki. 2011. Subtyping delimited continuations. In Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011, Manuel M.\u00a0T. Chakravarty, Zhenjiang Hu, and Olivier Danvy (Eds.). ACM, 81\u201393. https:\/\/doi.org\/10.1145\/2034773.2034786"},{"key":"e_1_3_2_1_16_1","volume-title":"APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705)","author":"Materzok Marek","year":"2012","unstructured":"Marek Materzok and Dariusz Biernacki . 2012 . A Dynamic Interpretation of the CPS Hierarchy. In Programming Languages and Systems - 10th Asian Symposium , APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705) , Ranjit Jhala and Atsushi Igarashi (Eds.). Springer, 296\u2013311. https:\/\/doi.org\/10.1007\/978-3-642-35182-2_21 10.1007\/978-3-642-35182-2_21 Marek Materzok and Dariusz Biernacki. 2012. A Dynamic Interpretation of the CPS Hierarchy. In Programming Languages and Systems - 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705), Ranjit Jhala and Atsushi Igarashi (Eds.). Springer, 296\u2013311. https:\/\/doi.org\/10.1007\/978-3-642-35182-2_21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77353"},{"key":"e_1_3_2_1_18_1","volume-title":"Typed Equivalence of Effect Handlers and Delimited Control. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019","author":"Pir\u00f3g Maciej","year":"2019","unstructured":"Maciej Pir\u00f3g , Piotr Polesiuk , and Filip Sieczkowski . 2019 . Typed Equivalence of Effect Handlers and Delimited Control. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 , June 24-30, 2019, Dortmund, Germany(LIPIcs, Vol.\u00a0131), Herman Geuvers (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 30:1\u201330:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD. 2019.30 10.4230\/LIPIcs.FSCD.2019.30 Maciej Pir\u00f3g, Piotr Polesiuk, and Filip Sieczkowski. 2019. Typed Equivalence of Effect Handlers and Delimited Control. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany(LIPIcs, Vol.\u00a0131), Herman Geuvers (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 30:1\u201330:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.30"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_3_2_1_20_1","volume-title":"Plotkin and Matija Pretnar","author":"D.","year":"2009","unstructured":"Gordon\u00a0 D. Plotkin and Matija Pretnar . 2009 . Handlers of Algebraic Effects. In Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings(Lecture Notes in Computer Science, Vol.\u00a05502), Giuseppe Castagna (Ed.). Springer , 80\u201394. https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7 10.1007\/978-3-642-00590-9_7 Gordon\u00a0D. Plotkin and Matija Pretnar. 2009. Handlers of Algebraic Effects. In Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings(Lecture Notes in Computer Science, Vol.\u00a05502), Giuseppe Castagna (Ed.). Springer, 80\u201394. https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/267959.269968"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9010-4"}],"event":{"name":"PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2021","location":"Tallinn Estonia"},"container-title":["23rd International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479394.3479399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3479394.3479399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:52Z","timestamp":1750191532000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479394.3479399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":24,"alternative-id":["10.1145\/3479394.3479399","10.1145\/3479394"],"URL":"https:\/\/doi.org\/10.1145\/3479394.3479399","relation":{},"subject":[],"published":{"date-parts":[[2021,9,6]]},"assertion":[{"value":"2021-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}