{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:15:07Z","timestamp":1730315707932,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,20]]},"DOI":"10.1145\/2003476.2003487","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"53-64","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimally strict polymorphic functions"],"prefix":"10.1145","author":[{"given":"Jan","family":"Christiansen","sequence":"first","affiliation":[{"name":"Christian-Albrechts-Universit\u00e4t Kiel, Kiel, Germany"}]},{"given":"Daniel","family":"Seidel","sequence":"additional","affiliation":[{"name":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn, Bonn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_8"},{"key":"e_1_3_2_1_2_1","unstructured":"S. B\u00f6hme. Free Theorems for sublanguages of Haskell 2007. Master's thesis Technische Universit\u00e4t Dresden. S. B\u00f6hme. Free Theorems for sublanguages of Haskell 2007. Master's thesis Technische Universit\u00e4t Dresden."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645709.664318"},{"key":"e_1_3_2_1_4_1","first-page":"160","volume-title":"Sloth - A Tool for Checking Minimal Strictness. In PADL'11 Proceedings","volume":"6539","author":"Christiansen J.","year":"2011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27764-4_6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863529"},{"volume-title":"Cambridge University Press","year":"2003","author":"Peyton Jones S.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788446.1788459"},{"volume-title":"Taming Selective Strictness. In ATPS'09 Proceedings. GI","year":"2009","author":"Seidel D.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480904"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"PPDP '11: Symposium on Principles and Practices of Declarative Programming","sponsor":["University of Southern Denmark","Danish Agency for Science Technology and Innovation DASTI","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Odense Denmark","acronym":"PPDP '11"},"container-title":["Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003476.2003487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T23:06:43Z","timestamp":1673564803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":12,"alternative-id":["10.1145\/2003476.2003487","10.1145\/2003476"],"URL":"https:\/\/doi.org\/10.1145\/2003476.2003487","relation":{},"subject":[],"published":{"date-parts":[[2011,7,20]]},"assertion":[{"value":"2011-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}