{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:12:33Z","timestamp":1773429153400,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819535842","type":"print"},{"value":"9789819535859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"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-981-95-3585-9_5","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:06:31Z","timestamp":1761804391000},"page":"88-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Expressive Power of\u00a0One-Shot Control Operators and\u00a0Coroutines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3505-7151","authenticated-orcid":false,"given":"Kentaro","family":"Kobayashi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2693-5133","authenticated-orcid":false,"given":"Yukiyoshi","family":"Kameyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-22941-1_2","volume-title":"Trends in Functional Programming","author":"K Anton","year":"2011","unstructured":"Anton, K., Thiemann, P.: Typing coroutines. In: Page, R., Horv\u00e1th, Z., Zs\u00f3k, V. (eds.) TFP 2010. LNCS, vol. 6546, pp. 16\u201330. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22941-1_2"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Berdine, J., O\u2019Hearn, P.W., Reddy, U.S., Thielecke, H.: Linear continuation-passing. High. Order Symb. Comput. 15(2\u20133), 181\u2013208 (2002). https:\/\/doi.org\/10.1023\/A:1020891112409","DOI":"10.1023\/A:1020891112409"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bruggeman, C., Waddell, O., Dybvig, R.K.: Representing control in the presence of one-shot continuations. In: Fischer, C.N. (ed.) Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation (PLDI), Philadephia, Pennsylvania, USA, 21\u201324 May 1996, pp. 99\u2013107. ACM (1996). https:\/\/doi.org\/10.1145\/231379.231395","DOI":"10.1145\/231379.231395"},{"key":"5_CR4","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. BRICS 89\/12 (1989)"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Felleisen, M.: On the expressive power of programming languages. Sci. Comput. Program. 17(1\u20133), 35\u201375 (1991). https:\/\/doi.org\/10.1016\/0167-6423(91)90036-W","DOI":"10.1016\/0167-6423(91)90036-W"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-17945-3_12","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"M Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D.P.: A reduction semantics for imperative higher-order languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 206\u2013223. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17945-3_12"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Forster, Y., Kammar, O., Lindley, S., Pretnar, M.: On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. J. Funct. Program. 29,\u00a0e15 (2019). https:\/\/doi.org\/10.1017\/S0956796819000121","DOI":"10.1017\/S0956796819000121"},{"key":"5_CR8","unstructured":"James, R.P., Sabry, A.: Yield: mainstream delimited continuations. In: Proceedings of the 1st International Workshop on Theory and Practice of Delimited Continuations (TPDC 2011), 12 pages (2011)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-57761-2_8","volume-title":"Trends in Functional Programming","author":"S Kawahara","year":"2020","unstructured":"Kawahara, S., Kameyama, Y.: One-shot algebraic effects as coroutines. In: Byrski, A., Hughes, J. (eds.) TFP 2020. LNCS, vol. 12222, pp. 159\u2013179. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57761-2_8"},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0954-6","volume-title":"Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation","author":"PB Levy","year":"2004","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation, vol. 2. Springer, Dordrecht (2004). https:\/\/doi.org\/10.1007\/978-94-007-0954-6"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-35182-2_21","volume-title":"Programming Languages and Systems","author":"M Materzok","year":"2012","unstructured":"Materzok, M., Biernacki, D.: A dynamic interpretation of the CPS hierarchy. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 296\u2013311. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35182-2_21"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"de\u00a0Moura, A.L., Ierusalimschy, R.: Revisiting coroutines. ACM Trans. Program. Lang. Syst. 31(2), 6:1\u20136:31 (2009). https:\/\/doi.org\/10.1145\/1462166.1462167","DOI":"10.1145\/1462166.1462167"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categorical Struct. 11(1), 69\u201394 (2003). https:\/\/doi.org\/10.1023\/A:1023064908962","DOI":"10.1023\/A:1023064908962"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-00590-9_7","volume-title":"Programming Languages and Systems","author":"G Plotkin","year":"2009","unstructured":"Plotkin, G., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80\u201394. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"de\u00a0Vilhena, P.E., Pottier, F.: A separation logic for effect handlers. Proc. ACM Program. Lang. 5(POPL), 1\u201328 (2021). https:\/\/doi.org\/10.1145\/3434314","DOI":"10.1145\/3434314"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3585-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:13:31Z","timestamp":1773425611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3585-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"ISBN":["9789819535842","9789819535859"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3585-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,31]]},"assertion":[{"value":"31 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/track\/aplas-2025\/aplas-2025-aplas-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}