{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T09:10:27Z","timestamp":1770023427642,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"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":[[2019,8,8]]},"DOI":"10.1145\/3331545.3342589","type":"proceedings-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T20:51:45Z","timestamp":1564433505000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the \u03bcVeriFast verifier as a case study"],"prefix":"10.1145","author":[{"given":"Dominique","family":"Devriese","sequence":"first","affiliation":[{"name":"Vrije Universiteit Brussel, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aaron Levin. 2016. Extensible Effects in the van Laarhoven Free Monad. (Jan. 2016). http:\/\/aaronlevin.ca\/post\/136494428283\/extensible-effectsin-the-van-laarhoven-free-monad  Aaron Levin. 2016. Extensible Effects in the van Laarhoven Free Monad. (Jan. 2016). http:\/\/aaronlevin.ca\/post\/136494428283\/extensible-effectsin-the-van-laarhoven-free-monad"},{"key":"e_1_3_2_1_2_1","unstructured":"Andreas Hartmann. 2018. Structuring Functional Programs with Tagless Final. (June 2018). https:\/\/www.becompany.ch\/en\/blog\/2018\/06\/ 21\/tagless-final  Andreas Hartmann. 2018. Structuring Functional Programs with Tagless Final. (June 2018). https:\/\/www.becompany.ch\/en\/blog\/2018\/06\/ 21\/tagless-final"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.02.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290319"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242744.3242746"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3122955.3122967"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628141"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_1_9_1","unstructured":"John A. De Goes. 2018. No More Transformers: High-Performance Effects in Scalaz 8. (May 2018). http:\/\/degoes.net\/articles\/effectswithout-transformers  John A. De Goes. 2018. No More Transformers: High-Performance Effects in Scalaz 8. (May 2018). http:\/\/degoes.net\/articles\/effectswithout-transformers"},{"key":"e_1_3_2_1_10_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (Lecture Notes in Computer Science)","author":"de Moura Leonardo"},{"key":"e_1_3_2_1_11_1","volume-title":"European Symposium on Security and Privacy. IEEE.","author":"Devriese Dominique","year":"2016"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11431664_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"e_1_3_2_1_14_1","volume-title":"Capability: The {ReaderT} Pattern without Boilerplate. (Oct.","author":"Herrmann Andreas","year":"2018"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"Jacobs Bart"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Bart Jacobs Fr\u00e9d\u00e9ric Vogels and Frank Piessens. 2015. Featherweight VeriFast. Logical Methods in Computer Science Volume 11 Issue 3 (Sept. 2015). https:\/\/lmcs.episciences.org\/1595\/pdf  Bart Jacobs Fr\u00e9d\u00e9ric Vogels and Frank Piessens. 2015. Featherweight VeriFast. Logical Methods in Computer Science Volume 11 Issue 3 (Sept. 2015). https:\/\/lmcs.episciences.org\/1595\/pdf","DOI":"10.2168\/LMCS-11(3:19)2015"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_6"},{"key":"e_1_3_2_1_18_1","volume-title":"Monatron: An Extensible Monad Transformer Library. In Implementation and Application of Functional Languages (Lecture Notes in Computer Science), Sven-Bodo Scholz and Olaf Chitil (Eds.)","author":"Jaskelioff Mauro","year":"2011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500590"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804319"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503778.2503791"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017481"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178246"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199528"},{"key":"e_1_3_2_1_25_1","unstructured":"Mark S. Miller. 2006. Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control. Ph.D. Dissertation. Johns Hopkins University.   Mark S. Miller. 2006. Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control. Ph.D. Dissertation. Johns Hopkins University."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"e_1_3_2_1_27_1","unstructured":"Russell O\u2019Connor. 2014. Van Laarhoven Free Monad. (Feb. 2014). http:\/\/r6.ca\/blog\/20140210T181244Z.html  Russell O\u2019Connor. 2014. Van Laarhoven Free Monad. (Feb. 2014). http:\/\/r6.ca\/blog\/20140210T181244Z.html"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034781"},{"key":"e_1_3_2_1_29_1","unstructured":"Ryan Scott. 2018. How QuantifiedConstraints Can Let Us Put Join Back in Monad. (March 2018). https:\/\/ryanglscott.github.io\/2018\/03\/04\/howquantifiedconstraints-can-let-us-put-join-back-in-monad\/  Ryan Scott. 2018. How QuantifiedConstraints Can Let Us Put Join Back in Monad. (March 2018). https:\/\/ryanglscott.github.io\/2018\/03\/04\/howquantifiedconstraints-can-let-us-put-join-back-in-monad\/"},{"key":"e_1_3_2_1_30_1","unstructured":"Austin Seipp. 2013. Reflecting Values to Types and Back. School of Haskell (Aug. 2013). https:\/\/www.schoolofhaskell.com\/user\/ thoughtpolice\/using-reflection  Austin Seipp. 2013. Reflecting Values to Types and Back. School of Haskell (Aug. 2013). https:\/\/www.schoolofhaskell.com\/user\/ thoughtpolice\/using-reflection"},{"key":"e_1_3_2_1_31_1","unstructured":"Michael Snoyman. 2017. The ReaderT Design Pattern. (June 2017). https:\/\/www.fpcomplete.com\/blog\/2017\/06\/readert-design-pattern  Michael Snoyman. 2017. The ReaderT Design Pattern. (June 2017). https:\/\/www.fpcomplete.com\/blog\/2017\/06\/readert-design-pattern"},{"key":"e_1_3_2_1_32_1","unstructured":"Henning Thielemann. 2013. Mutable Variable. (June 2013). https: \/\/wiki.haskell.org\/Mutable_variable  Henning Thielemann. 2013. Mutable Variable. (June 2013). https: \/\/wiki.haskell.org\/Mutable_variable"},{"key":"e_1_3_2_1_33_1","unstructured":"Twan van Laarhoven. 2009. CPS Based Functional References. (July 2009). https:\/\/www.twanvl.nl\/blog\/haskell\/cps-functional-references  Twan van Laarhoven. 2009. CPS Based Functional References. (July 2009). https:\/\/www.twanvl.nl\/blog\/haskell\/cps-functional-references"},{"key":"e_1_3_2_1_34_1","unstructured":"Vasiliy Kevroletin. 2018. Introduction to Tagless Final. (Dec. 2018). https:\/\/serokell.io\/blog\/2018\/12\/07\/tagless-final  Vasiliy Kevroletin. 2018. Introduction to Tagless Final. (Dec. 2018). https:\/\/serokell.io\/blog\/2018\/12\/07\/tagless-final"},{"key":"e_1_3_2_1_35_1","unstructured":"Fr\u00e9d\u00e9ric Vogels. 2012. Formalisation and Soundness of Static Verification Algorithms for Imperative Programs (Formalisatie en correctheid van statische verificatiealgoritmes voor imperatieve programma\u2019s). Ph.D. Dissertation. https:\/\/lirias.kuleuven.be\/retrieve\/204848  Fr\u00e9d\u00e9ric Vogels. 2012. Formalisation and Soundness of Static Verification Algorithms for Imperative Programs (Formalisatie en correctheid van statische verificatiealgoritmes voor imperatieve programma\u2019s). Ph.D. Dissertation. https:\/\/lirias.kuleuven.be\/retrieve\/204848"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596577"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"},{"key":"e_1_3_2_1_38_1","volume-title":"Coherent Explicit Dictionary Application for Haskell. In Haskell Symposium.","author":"Winant Thomas","year":"2018"},{"key":"e_1_3_2_1_39_1","unstructured":"Nicolas Wu and Tom Schrijvers. 2015. Fusion for Free. In Mathematics of Program Construction.  Nicolas Wu and Tom Schrijvers. 2015. Fusion for Free. In Mathematics of Program Construction."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290318"}],"event":{"name":"ICFP '19: ACM SIGPLAN International Conference on Functional Programming","location":"Berlin Germany","acronym":"ICFP '19","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331545.3342589","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331545.3342589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:38Z","timestamp":1750202018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331545.3342589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":40,"alternative-id":["10.1145\/3331545.3342589","10.1145\/3331545"],"URL":"https:\/\/doi.org\/10.1145\/3331545.3342589","relation":{},"subject":[],"published":{"date-parts":[[2019,8,8]]},"assertion":[{"value":"2019-08-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}