{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:06:32Z","timestamp":1770278792565,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031213137","type":"print"},{"value":"9783031213144","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21314-4_4","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"59-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Understanding Algebraic Effect Handlers via Delimited Control Operators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2315-6182","authenticated-orcid":false,"given":"Youyou","family":"Cong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8040-0394","authenticated-orcid":false,"given":"Kenichi","family":"Asai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10990-009-9049-5","volume":"22","author":"K Asai","year":"2009","unstructured":"Asai, K.: On typing delimited continuations: three new solutions to the printf problem. Higher-Order Symb. Comput. 22(3), 275\u2013291 (2009). https:\/\/doi.org\/10.1007\/s10990-009-9049-5","journal-title":"Higher-Order Symb. Comput."},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Asai, K., Uehara, C.: Selective CPS transformation for shift and reset. In: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pp. 40\u201352. PEPM 2018, ACM, New York (2017). https:\/\/doi.org\/10.1145\/3162069","DOI":"10.1145\/3162069"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40206-7_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"A Bauer","year":"2013","unstructured":"Bauer, A., Pretnar, M.: An effect system for algebraic effects and handlers. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 1\u201316. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_1"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2794078","volume":"38","author":"D Biernacki","year":"2015","unstructured":"Biernacki, D., Danvy, O., Millikin, K.: A dynamic continuation-passing style for dynamic delimited continuations. ACM Trans. Program. Lang. Syst. 38(1), 1\u201325 (2015). https:\/\/doi.org\/10.1145\/2794078","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"POPL","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158096","volume":"2","author":"D Biernacki","year":"2017","unstructured":"Biernacki, D., Pir\u00f3g, M., Polesiuk, P., Sieczkowski, F.: Handle with care: relational interpretation of algebraic effects and handlers. Proc. ACM Program. Lang. 2(POPL), 1\u201330 (2017). https:\/\/doi.org\/10.1145\/3158096","journal-title":"Proc. ACM Program. Lang."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Biernacki, D., Pyzik, M., Sieczkowski, F.: Reflecting stacked continuations in a fine-grained direct-style reduction theory. In: PPDP 2021, Association for Computing Machinery, pp. 1\u201313. New York (2021). https:\/\/doi.org\/10.1145\/3479394.3479399","DOI":"10.1145\/3479394.3479399"},{"issue":"OOPSLA","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3276481","volume":"2","author":"JI Brachth\u00e4user","year":"2018","unstructured":"Brachth\u00e4user, J.I., Schuster, P., Ostermann, K.: Effect handlers for the masses. Proc. ACM Program. Lang. 2(OOPSLA), 1\u201327 (2018)","journal-title":"Proc. ACM Program. Lang."},{"issue":"OOPSLA","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3428194","volume":"4","author":"JI Brachth\u00e4user","year":"2020","unstructured":"Brachth\u00e4user, J.I., Schuster, P., Ostermann, K.: Effects as capabilities: effect handlers and lightweight effect polymorphism. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201330 (2020). https:\/\/doi.org\/10.1145\/3428194","journal-title":"Proc. ACM Program. Lang."},{"key":"4_CR9","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. BRICS 89\/12 (1989)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp. 151\u2013160. ACM (1990)","DOI":"10.1145\/91556.91622"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1017\/S0956796807006259","volume":"17","author":"RK Dyvbig","year":"2007","unstructured":"Dyvbig, R.K., Peyton Jones, S., Sabry, A.: A monadic framework for delimited continuations. J. Funct. Program. 17(6), 687\u2013730 (2007). https:\/\/doi.org\/10.1017\/S0956796807006259","journal-title":"J. Funct. Program."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: On the expressive power of programming languages. In: Selected Papers from the Symposium on 3rd European Symposium on Programming, pp. 35\u201375. ESOP 1990, Elsevier North-Holland Inc, New York (1991)","DOI":"10.1016\/0167-6423(91)90036-W"},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796819000121","volume":"29","author":"Y Forster","year":"2019","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, e15 (2019). https:\/\/doi.org\/10.1017\/S0956796819000121","journal-title":"J. Funct. Program."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Hillerstr\u00f6m, D., Lindley, S.: Liberating effects with rows and handlers. In: Proceedings of the 1st International Workshop on Type-Driven Development, pp. 15\u201327. TyDe 2016, ACM, New York (2016). https:\/\/doi.org\/10.1145\/2976022.2976033","DOI":"10.1145\/2976022.2976033"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02768-1_22","volume-title":"Programming Languages and Systems","author":"D Hillerstr\u00f6m","year":"2018","unstructured":"Hillerstr\u00f6m, D., Lindley, S.: Shallow effect handlers. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 415\u2013435. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_22"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000040","volume":"30","author":"D Hillerstr\u00f6m","year":"2020","unstructured":"Hillerstr\u00f6m, D., Lindley, S., Atkey, R.: Effect handlers via generalised continuations. J. Funct. Program. 30, e5 (2020). https:\/\/doi.org\/10.1017\/S0956796820000040","journal-title":"J. Funct. Program."},{"key":"4_CR17","unstructured":"Hillerstr\u00f6m, D., Lindley, S., Atkey, R., Sivaramakrishnan, K.: Continuation passing style for effect handlers. In: Proceedings of 2nd International Conference on Formal Structures for Computation and Deduction, pp. 18:1\u201318:19. FSCD 2017, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-78969-7_18","volume-title":"Functional and Logic Programming","author":"Y Kameyama","year":"2008","unstructured":"Kameyama, Y., Yonezawa, T.: Typed dynamic control operators for delimited continuations. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 239\u2013254. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78969-7_18"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. In: Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, pp. 145\u2013158. ICFP 2013, ACM, New York (2013). https:\/\/doi.org\/10.1145\/2500365.2500590","DOI":"10.1145\/2500365.2500590"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-73228-0_17","volume-title":"Typed Lambda Calculi and Applications","author":"O Kiselyov","year":"2007","unstructured":"Kiselyov, O., Shan, C.: A substructural type system for delimited continuations. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 223\u2013239. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73228-0_17"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Sivaramakrishnan, K.C.: Eff directly in OCaml. In: Asai, K., Shinwell, M. (eds.) Proceedings of ML\/OCaml 2016, pp. 23\u201358 (2018). https:\/\/doi.org\/10.4204\/EPTCS.285.2","DOI":"10.4204\/EPTCS.285.2"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Kobori, I., Kameyama, Y., Kiselyov, O.: Answer-type modification without tears: prompt-passing style translation for typed delimited-control operators. In: Electronic Proceedings in Theoretical Computer Science EPTCS 212 (Post-Proceedings of the Workshop on Continuations 2015), pp. 36\u201352 (2016). https:\/\/doi.org\/10.4204\/EPTCS.212.3","DOI":"10.4204\/EPTCS.212.3"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Leijen, D.: Koka: programming with row polymorphic effect types. In: 5th Workshop on Mathematically Structured Functional Programming. MSFP 2014 (2014). https:\/\/doi.org\/10.4204\/EPTCS.153.8","DOI":"10.4204\/EPTCS.153.8"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Leijen, D.: Type directed compilation of row-typed algebraic effects. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 486\u2013499. POPL 2017, ACM, New York (2017). https:\/\/doi.org\/10.1145\/3009837.3009872","DOI":"10.1145\/3009837.3009872"},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0954-6","volume-title":"Call-By-Push-Value: A Functional\/Imperative Synthesis","author":"PB Levy","year":"2003","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis. Springer, Dordrecht (2003). https:\/\/doi.org\/10.1007\/978-94-007-0954-6"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0890-5401(03)00088-9","volume":"185","author":"PB Levy","year":"2003","unstructured":"Levy, P.B., Power, J., Thielecke, H.: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2), 182\u2013210 (2003)","journal-title":"Inf. Comput."},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Lindley, S., McBride, C., McLaughlin, C.: Do be do be do. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 500\u2013514. POPL 2017, ACM, New York (2017). https:\/\/doi.org\/10.1145\/3009837.3009897","DOI":"10.1145\/3009837.3009897"},{"key":"4_CR28","unstructured":"Materzok, M.: Axiomatizing subtyped delimited continuations. In: Computer Science Logic 2013. CSL 2013, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Materzok, M., Biernacki, D.: Subtyping delimited continuations. In: Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming, pp. 81\u201393. ICFP 2011, ACM, New York (2011). https:\/\/doi.org\/10.1145\/2034773.2034786","DOI":"10.1145\/2034773.2034786"},{"key":"4_CR30","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":"4_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S1571-0661(04)80969-1","volume":"45","author":"LR Nielsen","year":"2001","unstructured":"Nielsen, L.R.: A selective CPS transformation. Electron. Notes Theor. Comput. Sci. 45, 311\u2013331 (2001)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-662-03811-6_5","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Type and effect systems. In: Principles of Program Analysis, pp. 283\u2013363. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6_5"},{"key":"4_CR33","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Chalmers University of Technology (2007)"},{"key":"4_CR34","unstructured":"Pir\u00f3g, M., Polesiuk, P., Sieczkowski, F.: Typed equivalence of effect handlers and delimited control. In: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"2","key":"4_CR35","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)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1023064908962","volume":"11","author":"G Plotkin","year":"2003","unstructured":"Plotkin, G., Power, J.: Algebraic operations and generic effects. Appl. Categ. Struct. 11(1), 69\u201394 (2003). https:\/\/doi.org\/10.1023\/A:1023064908962","journal-title":"Appl. Categ. Struct."},{"key":"4_CR37","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":"4_CR38","first-page":"67","volume-title":"Type Inference for Records in Natural Extension of ML","author":"D R\u00e9my","year":"1994","unstructured":"R\u00e9my, D.: Type Inference for Records in Natural Extension of ML, pp. 67\u201395. MIT Press, Cambridge (1994)"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Rompf, T., Maier, I., Odersky, M.: Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform. In: Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming, pp. 317\u2013328. ICFP 2009, ACM, New York (2009). https:\/\/doi.org\/10.1145\/1596550.1596596","DOI":"10.1145\/1596550.1596596"},{"issue":"ICFP","key":"4_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3408975","volume":"4","author":"P Schuster","year":"2020","unstructured":"Schuster, P., Brachth\u00e4user, J.I., Ostermann, K.: Compiling effect handlers in capability-passing style. Proc. ACM Program. Lang. 4(ICFP), 1\u201328 (2020). https:\/\/doi.org\/10.1145\/3408975","journal-title":"Proc. ACM Program. Lang."},{"issue":"4","key":"4_CR41","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10990-007-9010-4","volume":"20","author":"CC Shan","year":"2007","unstructured":"Shan, C.C.: A static simulation of dynamic delimited control. Higher-Order Symb. Comput. 20(4), 371\u2013401 (2007)","journal-title":"Higher-Order Symb. Comput."},{"issue":"ICFP","key":"4_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3408981","volume":"4","author":"N Xie","year":"2020","unstructured":"Xie, N., Brachth\u00e4user, J.I., Hillerstr\u00f6m, D., Schuster, P., Leijen, D.: Effect handlers, evidently. Proc. ACM Program. Lang. 4(ICFP), 1\u201329 (2020). https:\/\/doi.org\/10.1145\/3408981","journal-title":"Proc. ACM Program. Lang."},{"issue":"POPL","key":"4_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290318","volume":"3","author":"Y Zhang","year":"2019","unstructured":"Zhang, Y., Myers, A.C.: Abstraction-safe effect handlers via tunneling. Proc. ACM Program. Lang. 3(POPL), 1\u201329 (2019). https:\/\/doi.org\/10.1145\/3290318","journal-title":"Proc. ACM Program. Lang."},{"issue":"OOPSLA","key":"4_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3428207","volume":"4","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Salvaneschi, G., Myers, A.C.: Handling bidirectional control flow. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201330 (2020). https:\/\/doi.org\/10.1145\/3428207","journal-title":"Proc. ACM Program. Lang."}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21314-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T06:01:42Z","timestamp":1672552902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21314-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031213137","9783031213144"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21314-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2022","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":"tfp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}