{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:34Z","timestamp":1772164054355,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T00:00:00Z","timestamp":1379894400000},"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":[[2013,9,23]]},"DOI":"10.1145\/2503778.2503788","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T15:57:05Z","timestamp":1379433425000},"page":"141-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Causality of optimized Haskell"],"prefix":"10.1145","author":[{"given":"Peter M.","family":"Wortmann","sequence":"first","affiliation":[{"name":"University of Leeds, Leeds, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Duke","sequence":"additional","affiliation":[{"name":"University of Leeds, Leeds, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"UNIX International Programming Languages SIG","author":"DWARF","year":"1993","unstructured":"DWARF debugging information format, version 2. Technical report , UNIX International Programming Languages SIG , 1993 . DWARF debugging information format, version 2. Technical report, UNIX International Programming Languages SIG, 1993."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143108"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291201.1291203"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806987"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596649"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.660855"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_13_1","unstructured":"D. Lewis. Counterfactuals. Blackwell Publishers Oxford 1973. ISBN 978-0-631-22425-9.  D. Lewis. Counterfactuals. Blackwell Publishers Oxford 1973. ISBN 978-0-631-22425-9."},{"key":"e_1_3_2_1_14_1","volume-title":"Why can't I get a stack trace?","author":"Marlow S.","year":"2012","unstructured":"S. Marlow . Why can't I get a stack trace? Sept. 2012 . URL haskell.org\/haskellwiki\/HaskellImplementorsWorkshop\/2012. S. Marlow. Why can't I get a stack trace? Sept. 2012. URL haskell.org\/haskellwiki\/HaskellImplementorsWorkshop\/2012."},{"key":"e_1_3_2_1_15_1","first-page":"195","volume-title":"Functional Programming, Glasgow","author":"Partain W.","year":"1992","unstructured":"W. Partain . The nofib benchmark suite of Haskell programs . In Functional Programming, Glasgow 1992 , pages 195 -- 202 . Springer , 1993. W. Partain. The nofib benchmark suite of Haskell programs. In Functional Programming, Glasgow 1992, pages 195--202. Springer, 1993."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364579"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(97)00029-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004331"},{"key":"e_1_3_2_1_19_1","volume-title":"JFIT '93","author":"Peyton Jones S. L.","year":"1993","unstructured":"S. L. Peyton Jones , C. V. Hall , K. Hammond , W. Partain , and P. Wadler . The Glasgow Haskell compiler: a technical overview. In phProceedings of Joint Framework for Information Technology Technical Conference , JFIT '93 , March 1993 . S. L. Peyton Jones, C. V. Hall, K. Hammond, W. Partain, and P. Wadler. The Glasgow Haskell compiler: a technical overview. In phProceedings of Joint Framework for Information Technology Technical Conference, JFIT '93, March 1993."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232630"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647976.743227"},{"key":"e_1_3_2_1_22_1","first-page":"203","volume-title":"Proceedings of the 2001 Haskell Workshop, Haskell '01","author":"Peyton Jones S. L.","year":"2001","unstructured":"S. L. Peyton Jones , A. Tolmach , and T. Hoare . Playing by the rules: Rewriting as a practical optimization technique in GHC . In Proceedings of the 2001 Haskell Workshop, Haskell '01 , pages 203 -- 233 , Sept. 2001 . S. L. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: Rewriting as a practical optimization technique in GHC. In Proceedings of the 2001 Haskell Workshop, Haskell '01, pages 203--233, Sept. 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232633"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/244795.244802"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863538"},{"key":"e_1_3_2_1_28_1","volume-title":"State of Haskell","author":"Tibell J.","year":"2011","unstructured":"J. Tibell . State of Haskell , 2011 Survey, Aug. 2011. URL http:\/\/blog.johantibell.com\/2011\/08\/results-from-state-of-haskell-2011.html. J. Tibell. State of Haskell, 2011 Survey, Aug. 2011. URL http:\/\/blog.johantibell.com\/2011\/08\/results-from-state-of-haskell-2011.html."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143169"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503778.2503788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:27Z","timestamp":1750217307000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503788"}},"subtitle":["what is burning our cycles?"],"short-title":[],"issued":{"date-parts":[[2013,9,23]]},"references-count":27,"alternative-id":["10.1145\/2503778.2503788","10.1145\/2503778"],"URL":"https:\/\/doi.org\/10.1145\/2503778.2503788","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578854.2503788","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,23]]},"assertion":[{"value":"2013-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}