{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:06Z","timestamp":1750220526920,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"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":[[2021,8,18]]},"DOI":"10.1145\/3471874.3472986","type":"proceedings-article","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T02:11:59Z","timestamp":1629339119000},"page":"98-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Express: applications of dynamically typed Haskell expressions"],"prefix":"10.1145","author":[{"given":"Rudy","family":"Matela","sequence":"first","affiliation":[{"name":"n.n., n.n."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Rudy Matela Braquehais and Colin Runciman. 2016. FitSpec: refining property sets for functional testing. In Haskell\u201916. ACM 1\u201312.  Rudy Matela Braquehais and Colin Runciman. 2016. FitSpec: refining property sets for functional testing. In Haskell\u201916. ACM 1\u201312.","DOI":"10.1145\/3241625.2976003"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205368.3205371"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Rudy Matela Braquehais and Colin Runciman. 2017. Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results. In Haskell\u201917. ACM 40\u201351.  Rudy Matela Braquehais and Colin Runciman. 2017. Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results. In Haskell\u201917. ACM 40\u201351.","DOI":"10.1145\/3156695.3122961"},{"key":"e_1_3_2_1_5_1","unstructured":"Niklas Broberg. 2008\u20132020. haskell-src-exts: Manipulating Haskell source: abstract syntax lexer parser and pretty-printer. https:\/\/hackage.haskell.org\/package\/haskell-src-exts  Niklas Broberg. 2008\u20132020. haskell-src-exts: Manipulating Haskell source: abstract syntax lexer parser and pretty-printer. https:\/\/hackage.haskell.org\/package\/haskell-src-exts"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Koen Claessen. 2012. Shrinking and Showing Functions. In Haskell\u201912. ACM 73\u201380.  Koen Claessen. 2012. Shrinking and Showing Functions. In Haskell\u201912. ACM 73\u201380.","DOI":"10.1145\/2430532.2364516"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Koen Claessen and John Hughes. 2000. QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs. In ICFP\u201900. ACM.  Koen Claessen and John Hughes. 2000. QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs. In ICFP\u201900. ACM.","DOI":"10.1145\/351240.351266"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Koen Claessen and John Hughes. 2002. Testing Monadic Code with QuickCheck. In Haskell \u201902. ACM 65\u201377.  Koen Claessen and John Hughes. 2002. Testing Monadic Code with QuickCheck. In Haskell \u201902. ACM 65\u201377.","DOI":"10.1145\/581690.581696"},{"key":"e_1_3_2_1_9_1","volume-title":"TAP","author":"Claessen Koen","year":"2010","unstructured":"Koen Claessen , Nicholas Smallbone , and John Hughes . 2010. QuickSpec: Guessing Formal Specifications Using Testing . In TAP 2010 . Springer , 6\u201321. Koen Claessen, Nicholas Smallbone, and John Hughes. 2010. QuickSpec: Guessing Formal Specifications Using Testing. In TAP 2010. Springer, 6\u201321."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Jonas Dureg\u00e5rd Patrik Jansson and Meng Wang. 2012. Feat: functional enumeration of algebraic types. In Haskell\u201912. ACM 61\u201372.  Jonas Dureg\u00e5rd Patrik Jansson and Meng Wang. 2012. Feat: functional enumeration of algebraic types. In Haskell\u201912. ACM 61\u201372.","DOI":"10.1145\/2430532.2364515"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Martin Hofmann. 2010. IgorII - an analytical inductive functional programming system (tool demo). In PEPM. ACM 29\u201332.  Martin Hofmann. 2010. IgorII - an analytical inductive functional programming system (tool demo). In PEPM. ACM 29\u201332.","DOI":"10.1145\/1706356.1706364"},{"key":"e_1_3_2_1_13_1","unstructured":"Simon Peyton Jones. 2002. Haskell 98 Language and Libraries: The Revised Report. https:\/\/www.haskell.org\/onlinereport\/  Simon Peyton Jones. 2002. Haskell 98 Language and Libraries: The Revised Report. https:\/\/www.haskell.org\/onlinereport\/"},{"key":"e_1_3_2_1_14_1","volume-title":"Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation. In PRICAI 2004: Trends in Artificial Intelligence. Springer, 75\u201384","author":"Katayama Susumu","year":"2004","unstructured":"Susumu Katayama . 2004 . Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation. In PRICAI 2004: Trends in Artificial Intelligence. Springer, 75\u201384 . Susumu Katayama. 2004. Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation. In PRICAI 2004: Trends in Artificial Intelligence. Springer, 75\u201384."},{"key":"e_1_3_2_1_15_1","unstructured":"Susumu Katayama. 2007. Systematic search for lambda expressions. In Trends in Functional Programming (TFP2005). 6 Intellect 111\u2013126.  Susumu Katayama. 2007. Systematic search for lambda expressions. In Trends in Functional Programming (TFP2005). 6 Intellect 111\u2013126."},{"key":"e_1_3_2_1_16_1","volume-title":"Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening. In PRICAI 2008: Trends in Artificial Intelligence. Springer, 199\u2013210","author":"Katayama Susumu","year":"2008","unstructured":"Susumu Katayama . 2008 . Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening. In PRICAI 2008: Trends in Artificial Intelligence. Springer, 199\u2013210 . Susumu Katayama. 2008. Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening. In PRICAI 2008: Trends in Artificial Intelligence. Springer, 199\u2013210."},{"volume-title":"Recent Improvements of MagicHaskeller","author":"Katayama Susumu","key":"e_1_3_2_1_17_1","unstructured":"Susumu Katayama . 2010. Recent Improvements of MagicHaskeller . In AAIP. Springer , 174\u2013193. Susumu Katayama. 2010. Recent Improvements of MagicHaskeller. In AAIP. Springer, 174\u2013193."},{"key":"e_1_3_2_1_18_1","volume-title":"Rahul Gopinath, and Alex Groce.","author":"Le Duc","year":"2014","unstructured":"Duc Le , Mohammad Amin Alipour , Rahul Gopinath, and Alex Groce. 2014 . MuCheck: An Extensible Tool for Mutation Testing of Haskell Programs. In ISSTA 2014. ACM , 429\u2013432. Duc Le, Mohammad Amin Alipour, Rahul Gopinath, and Alex Groce. 2014. MuCheck: An Extensible Tool for Mutation Testing of Haskell Programs. In ISSTA 2014. ACM, 429\u2013432."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Simon Marlow. 2002. Haddock a Haskell documentation tool. In Haskell\u201902. ACM 78\u201389.  Simon Marlow. 2002. Haddock a Haskell documentation tool. In Haskell\u201902. ACM 78\u201389.","DOI":"10.1145\/581690.581697"},{"key":"e_1_3_2_1_20_1","unstructured":"Simon Marlow. 2010. Haskell 2010 language report. https:\/\/www.haskell.org\/onlinereport\/haskell2010  Simon Marlow. 2010. Haskell 2010 language report. https:\/\/www.haskell.org\/onlinereport\/haskell2010"},{"key":"e_1_3_2_1_21_1","unstructured":"Simon Marlow Sven Panne and Noel Winstanley. 2006\u20132019. haskell-src: Support for manipulating Haskell source code. https:\/\/hackage.haskell.org\/package\/haskell-src  Simon Marlow Sven Panne and Noel Winstanley. 2006\u20132019. haskell-src: Support for manipulating Haskell source code. https:\/\/hackage.haskell.org\/package\/haskell-src"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Lee Pike. 2014. SmartCheck: Automatic and Efficient Counterexample Reduction and Generalization. In Haskell\u201914. ACM 59\u201370.  Lee Pike. 2014. SmartCheck: Automatic and Efficient Counterexample Reduction and Generalization. In Haskell\u201914. ACM 59\u201370.","DOI":"10.1145\/2633357.2633365"},{"volume-title":"IFL\u201913","author":"Reich Jason S.","key":"e_1_3_2_1_23_1","unstructured":"Jason S. Reich , Matthew Naylor , and Colin Runciman . 2013. Advances in Lazy SmallCheck . In IFL\u201913 . Springer , 53\u201370. Jason S. Reich, Matthew Naylor, and Colin Runciman. 2013. Advances in Lazy SmallCheck. In IFL\u201913. Springer, 53\u201370."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Colin Runciman Matthew Naylor and Fredrik Lindblad. 2008. SmallCheck and Lazy SmallCheck: Automatic Exhaustive Testing for Small Values. In Haskell\u201908. ACM 37\u201348.  Colin Runciman Matthew Naylor and Fredrik Lindblad. 2008. SmallCheck and Lazy SmallCheck: Automatic Exhaustive Testing for Small Values. In Haskell\u201908. ACM 37\u201348.","DOI":"10.1145\/1411286.1411292"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Tim Sheard and Simon Peyton Jones. 2002. Template Meta-programming for Haskell. In Haskell\u201902. ACM 1\u201316.  Tim Sheard and Simon Peyton Jones. 2002. Template Meta-programming for Haskell. In Haskell\u201902. ACM 1\u201316.","DOI":"10.1145\/581690.581691"},{"key":"e_1_3_2_1_26_1","volume-title":"Quick specifications for the busy programmer. Journal of Functional Programming, 27","author":"Smallbone Nicholas","year":"2017","unstructured":"Nicholas Smallbone , Moa Johansson , Koen Claessen , and Maximilian Algehed . 2017. Quick specifications for the busy programmer. Journal of Functional Programming, 27 ( 2017 ). Nicholas Smallbone, Moa Johansson, Koen Claessen, and Maximilian Algehed. 2017. Quick specifications for the busy programmer. Journal of Functional Programming, 27 (2017)."},{"key":"e_1_3_2_1_27_1","volume-title":"Cheap Remarks About Concurrent Programs. In FLOPS 2018: Functional and Logic Programming (LNCS 10818)","author":"Walker Michael","year":"2018","unstructured":"Michael Walker and Colin Runciman . 2018 . Cheap Remarks About Concurrent Programs. In FLOPS 2018: Functional and Logic Programming (LNCS 10818) . Springer, 264\u2013279. Michael Walker and Colin Runciman. 2018. Cheap Remarks About Concurrent Programs. In FLOPS 2018: Functional and Logic Programming (LNCS 10818). Springer, 264\u2013279."}],"event":{"name":"ICFP '21: 26th ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Republic of Korea","acronym":"ICFP '21"},"container-title":["Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471874.3472986","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471874.3472986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:49Z","timestamp":1750195489000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471874.3472986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":25,"alternative-id":["10.1145\/3471874.3472986","10.1145\/3471874"],"URL":"https:\/\/doi.org\/10.1145\/3471874.3472986","relation":{},"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"2021-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}