{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:28Z","timestamp":1750306288802,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,14]]},"DOI":"10.1145\/2897336.2897340","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T15:20:09Z","timestamp":1469114409000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Polymonad programming in Haskell"],"prefix":"10.1145","author":[{"given":"Jan","family":"Bracker","sequence":"first","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henrik","family":"Nilsson","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Haskell 2010 language report 2010. https:\/\/www.haskell.org\/onlinereport\/haskell2010\/.  Haskell 2010 language report 2010. https:\/\/www.haskell.org\/onlinereport\/haskell2010\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9_21"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680900728X"},{"key":"e_1_3_2_1_4_1","unstructured":"G. Bierman N. Guts M. Hicks D. Leijen and N. Swamy. Type coercions for program rewriting. http:\/\/research.microsoft.com\/en-us\/projects\/coco\/.  G. Bierman N. Guts M. Hicks D. Leijen and N. Swamy. Type coercions for program rewriting. http:\/\/research.microsoft.com\/en-us\/projects\/coco\/."},{"key":"e_1_3_2_1_5_1","volume-title":"Sept.","author":"Bolingbroke M.","year":"2011","unstructured":"M. Bolingbroke . Constraint kinds for GHC , Sept. 2011 . http:\/\/blog.omega-prime.co.uk\/?p=127. M. Bolingbroke. Constraint kinds for GHC, Sept. 2011. http:\/\/blog.omega-prime.co.uk\/?p=127."},{"key":"e_1_3_2_1_6_1","volume-title":"jbracker\/polymonad-plugin","author":"Bracker J.","year":"2015","unstructured":"J. Bracker . jbracker\/polymonad-plugin , 2015 . https:\/\/github.com\/jbracker\/polymonad-plugin. J. Bracker. jbracker\/polymonad-plugin, 2015. https:\/\/github.com\/jbracker\/polymonad-plugin."},{"key":"e_1_3_2_1_7_1","volume-title":"jbracker\/polymonad-proofs","author":"Bracker J.","year":"2015","unstructured":"J. Bracker . jbracker\/polymonad-proofs , 2015 . https:\/\/github.com\/jbracker\/polymonad-proofs. J. Bracker. jbracker\/polymonad-proofs, 2015. https:\/\/github.com\/jbracker\/polymonad-proofs."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090189.1086397"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929553.1929564"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804307"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804305"},{"key":"e_1_3_2_1_12_1","volume-title":"Technical report","author":"Guts N.","year":"2012","unstructured":"N. Guts , M. Hicks , N. Swamy , D. Leijen , and G. Bierman . Polymonads . Technical report , University of Maryland Department of Computer Science , 2012 . Extended version of POPL'13 submission. N. Guts, M. Hicks, N. Swamy, D. Leijen, and G. Bierman. Polymonads. Technical report, University of Maryland Department of Computer Science, 2012. Extended version of POPL'13 submission."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.153.7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224198"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645394.651909"},{"key":"e_1_3_2_1_18_1","unstructured":"A. M. Joseph. Generalized Arrows. PhD thesis EECS Department University of California Berkeley 2014.  A. M. Joseph. Generalized Arrows . PhD thesis EECS Department University of California Berkeley 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535846"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-1-84882-912-1_14","volume-title":"Reflections on the Work of C.A.R. Hoare","author":"Kiselyov O.","year":"2010","unstructured":"O. Kiselyov , S. P. Jones , and C. chieh Shan. Fun with type functions . In A. Roscoe, C. B. Jones, and K. R. Wood, editors, Reflections on the Work of C.A.R. Hoare , pages 301 -- 331 . Springer London , 2010 . O. Kiselyov, S. P. Jones, and C. chieh Shan. Fun with type functions. In A. Roscoe, C. B. Jones, and K. R. Wood, editors, Reflections on the Work of C.A.R. Hoare, pages 301--331. Springer London, 2010."},{"key":"e_1_3_2_1_21_1","volume-title":"monad-param","author":"Kmett E.","year":"2006","unstructured":"E. Kmett . monad-param , 2006 --2011. http:\/\/hackage.haskell.org\/package\/monad-param. E. Kmett. monad-param, 2006--2011. http:\/\/hackage.haskell.org\/package\/monad-param."},{"key":"e_1_3_2_1_22_1","volume-title":"July","author":"Kmett E.","year":"2007","unstructured":"E. Kmett . Parameterized monads in Haskell , July 2007 . https:\/\/web.archive.org\/web\/20140712183502\/http:\/\/comonad.com\/reader\/2007\/parameterized-monads-in-haskell\/. E. Kmett. Parameterized monads in Haskell, July 2007. https:\/\/web.archive.org\/web\/20140712183502\/http:\/\/comonad.com\/reader\/2007\/parameterized-monads-in-haskell\/."},{"key":"e_1_3_2_1_23_1","volume-title":"Unpublished","author":"McBride C.","year":"2011","unstructured":"C. McBride . Functional pearl : Kleisli arrows of outrageous fortune . Unpublished , 2011 . C. McBride. Functional pearl: Kleisli arrows of outrageous fortune. Unpublished, 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_25_1","volume-title":"IEEE Computer Society Press","author":"Moggi E.","year":"1988","unstructured":"E. Moggi . Computational Lambda-Calculus and Monads . IEEE Computer Society Press , 1988 . E. Moggi. Computational Lambda-Calculus and Monads. IEEE Computer Society Press, 1988."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666202.2666208"},{"key":"e_1_3_2_1_29_1","volume-title":"effect-monad","author":"Orchard D.","year":"2013","unstructured":"D. Orchard . effect-monad , 2013 --2014. http:\/\/hackage.haskell.org\/package\/effect-monad. D. Orchard. effect-monad, 2013--2014. http:\/\/hackage.haskell.org\/package\/effect-monad."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633357.2633368"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/507546.507664"},{"key":"e_1_3_2_1_33_1","volume-title":"indexed","author":"Pope R.","year":"2004","unstructured":"R. Pope , E. A. Kmett , D. Menendez , and I. Diatchki . indexed , 2004 --2012. https:\/\/github.com\/reinerp\/indexed. R. Pope, E. A. Kmett, D. Menendez, and I. Diatchki. indexed, 2004--2012. https:\/\/github.com\/reinerp\/indexed."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543134.1411290"},{"key":"e_1_3_2_1_35_1","volume-title":"Notions of computation as monoids. Submitted to the Journal of Functional Programming","author":"Rivas E.","year":"2014","unstructured":"E. Rivas and M. Jaskelioff . Notions of computation as monoids. Submitted to the Journal of Functional Programming , 2014 . E. Rivas and M. Jaskelioff. Notions of computation as monoids. Submitted to the Journal of Functional Programming, 2014."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411203.1411215"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2544174.2500602"},{"key":"e_1_3_2_1_38_1","volume-title":"Rmonad","author":"Sittampalam G.","year":"2008","unstructured":"G. Sittampalam and P. Gavin . Rmonad , 2008 --2013. http:\/\/hackage.haskell.org\/package\/rmonad. G. Sittampalam and P. Gavin. Rmonad, 2008--2013. http:\/\/hackage.haskell.org\/package\/rmonad."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462166.1462169"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108970.1108974"},{"key":"e_1_3_2_1_41_1","first-page":"13","volume-title":"First Workshop on Constraint Handling Rules: Selected papers","author":"Stuckey P. J.","year":"2004","unstructured":"P. J. Stuckey , M. Sulzmann , and J. Wazny . The chameleon system. In T. Fr\u00fchwirth and M. Meister, editors , First Workshop on Constraint Handling Rules: Selected papers , pages 13 -- 32 . University of Ulm , 2004 . P. J. Stuckey, M. Sulzmann, and J. Wazny. The chameleon system. In T. Fr\u00fchwirth and M. Meister, editors, First Workshop on Constraint Handling Rules: Selected papers, pages 13--32. University of Ulm, 2004."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034574.2034778"},{"key":"e_1_3_2_1_43_1","volume-title":"The Glorious Glasgow Haskell Compilation System User's Guide","author":"Team The GHC","year":"2015","unstructured":"The GHC Team . The Glorious Glasgow Haskell Compilation System User's Guide , 2015 . http:\/\/downloads.haskell.org\/~ghc\/7.10.1\/docs\/html\/users_guide\/index.html. The GHC Team. The Glorious Glasgow Haskell Compilation System User's Guide, 2015. http:\/\/downloads.haskell.org\/~ghc\/7.10.1\/docs\/html\/users_guide\/index.html."},{"key":"e_1_3_2_1_44_1","volume-title":"simple-sessions","author":"Tov J. A.","year":"2008","unstructured":"J. A. Tov . simple-sessions , 2008 --2013. http:\/\/hackage.haskell.org\/package\/simple-sessions. J. A. Tov. simple-sessions, 2008--2013. http:\/\/hackage.haskell.org\/package\/simple-sessions."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143169"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019944"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103786.2103795"}],"event":{"name":"IFL '15: Symposium on the implementation and application of functional programming languages","acronym":"IFL '15","location":"Koblenz Germany"},"container-title":["Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897336.2897340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897336.2897340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:02Z","timestamp":1750221542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897336.2897340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,14]]},"references-count":46,"alternative-id":["10.1145\/2897336.2897340","10.1145\/2897336"],"URL":"https:\/\/doi.org\/10.1145\/2897336.2897340","relation":{},"subject":[],"published":{"date-parts":[[2015,9,14]]},"assertion":[{"value":"2015-09-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}