{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:43:57Z","timestamp":1770295437961,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030171834","type":"print"},{"value":"9783030171841","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_13","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T17:34:04Z","timestamp":1554572044000},"page":"353-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Handling Polymorphic Algebraic Effects"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9286-230X","authenticated-orcid":false,"given":"Taro","family":"Sekiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5143-9764","authenticated-orcid":false,"given":"Atsushi","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-54444-5_83","volume-title":"Programming Language Implementation and Logic Programming","author":"AW Appel","year":"1991","unstructured":"Appel, A.W., MacQueen, D.B.: Standard ML of New Jersey. In: Maluszy\u0144ski, J., Wirsing, M. (eds.) PLILP 1991. LNCS, vol. 528, pp. 1\u201313. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-54444-5_83"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-76637-7_16","volume-title":"Programming Languages and Systems","author":"K Asai","year":"2007","unstructured":"Asai, K., Kameyama, Y.: Polymorphic delimited continuations. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 239\u2013254. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-76637-7_16"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jlamp.2014.02.001","volume":"84","author":"A Bauer","year":"2015","unstructured":"Bauer, A., Pretnar, M.: Programming with algebraic effects and handlers. J. Log. Algebr. Methods Program. 84(1), 108\u2013123 (2015). \n                      https:\/\/doi.org\/10.1016\/j.jlamp.2014.02.001","journal-title":"J. Log. Algebr. Methods Program."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LISP and Functional Programming, pp. 151\u2013160 (1990). \n                      https:\/\/doi.org\/10.1145\/91556.91622","DOI":"10.1145\/91556.91622"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-89719-6_6","volume-title":"Trends in Functional Programming","author":"S Dolan","year":"2018","unstructured":"Dolan, S., Eliopoulos, S., Hillerstr\u00f6m, D., Madhavapeddy, A., Sivaramakrishnan, K.C., White, L.: Concurrent system programming with effect handlers. In: Wang, M., Owens, S. (eds.) TFP 2017. LNCS, vol. 10788, pp. 98\u2013117. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89719-6_6"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235\u2013271 (1992). \n                      https:\/\/doi.org\/10.1016\/0304-3975(92)90014-7","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Filinski, A.: Representing monads. In: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 446\u2013457 (1994). \n                      https:\/\/doi.org\/10.1145\/174675.178047","DOI":"10.1145\/174675.178047"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Filinski, A.: Monads in action. In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, pp. 483\u2013494 (2010). \n                      https:\/\/doi.org\/10.1145\/1706299.1706354","DOI":"10.1145\/1706299.1706354"},{"key":"13_CR9","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. PACMPL 1(ICFP), 13:1\u201313:29 (2017). \n                      https:\/\/doi.org\/10.1145\/3110257","DOI":"10.1145\/3110257"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-24754-8_15","volume-title":"Functional and Logic Programming","author":"J Garrigue","year":"2004","unstructured":"Garrigue, J.: Relaxing the value restriction. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 196\u2013213. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24754-8_15"},{"issue":"3\u20134","key":"13_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01019463","volume":"6","author":"R Harper","year":"1993","unstructured":"Harper, R., Lillibridge, M.: Polymorphic type assignment and CPS conversion. Lisp Symb. Comput. 6(3\u20134), 361\u2013380 (1993)","journal-title":"Lisp Symb. Comput."},{"key":"13_CR12","unstructured":"Hoang, M., Mitchell, J.C., Viswanathan, R.: Standard ML-NJ weak polymorphism and imperative constructs. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science, LICS 1993 (1993)"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. In: ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, pp. 145\u2013158 (2013). \n                      https:\/\/doi.org\/10.1145\/2500365.2500590","DOI":"10.1145\/2500365.2500590"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"e7","DOI":"10.1017\/S0956796816000320","volume":"27","author":"O Kammar","year":"2017","unstructured":"Kammar, O., Pretnar, M.: No value restriction is needed for algebraic effects and handlers. J. Funct. Program. 27, e7 (2017). \n                      https:\/\/doi.org\/10.1017\/S0956796816000320","journal-title":"J. Funct. Program."},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Ishii, H.: Freer monads, more extensible effects. In: Proceedings of the 8th ACM SIGPLAN Symposium on Haskell, Haskell 2015, pp. 94\u2013105 (2015). \n                      https:\/\/doi.org\/10.1145\/2804302.2804319","DOI":"10.1145\/2804302.2804319"},{"key":"13_CR16","unstructured":"Leijen, D.: Type directed compilation of row-typed algebraic effects. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 486\u2013499 (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3009872"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Leroy, X., Weis, P.: Polymorphic type inference and assignment. In: Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages, pp. 291\u2013302 (1991). \n                      https:\/\/doi.org\/10.1145\/99583.99622","DOI":"10.1145\/99583.99622"},{"key":"13_CR18","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, POPL 2017, pp. 500\u2013514 (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3009897"},{"key":"13_CR19","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-35182-2_21"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1023064908962","volume":"11","author":"GD Plotkin","year":"2003","unstructured":"Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categ. Struct. 11(1), 69\u201394 (2003). \n                      https:\/\/doi.org\/10.1023\/A:1023064908962","journal-title":"Appl. Categ. Struct."},{"key":"13_CR21","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":"GD Plotkin","year":"2009","unstructured":"Plotkin, G.D., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80\u201394. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7"},{"key":"13_CR22","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: IFIP Congress, pp. 513\u2013523 (1983)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90018-D","volume":"89","author":"M Tofte","year":"1990","unstructured":"Tofte, M.: Type inference for polymorphic references. Inf. Comput. 89(1), 1\u201334 (1990). \n                      https:\/\/doi.org\/10.1016\/0890-5401(90)90018-D","journal-title":"Inf. Comput."},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF01018828","volume":"8","author":"AK Wright","year":"1995","unstructured":"Wright, A.K.: Simple imperative polymorphism. Lisp Symb. Comput. 8(4), 343\u2013355 (1995)","journal-title":"Lisp Symb. Comput."},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"AK Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115(1), 38\u201394 (1994). \n                      https:\/\/doi.org\/10.1006\/inco.1994.1093","journal-title":"Inf. Comput."},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Wu, N., Schrijvers, T., Hinze, R.: Effect handlers in scope. In: Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell, Haskell 2014, pp. 1\u201312 (2014). \n                      https:\/\/doi.org\/10.1145\/2633357.2633358","DOI":"10.1145\/2633357.2633358"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:23:02Z","timestamp":1558344182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","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":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - 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"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}