{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:12Z","timestamp":1772163972517,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T00:00:00Z","timestamp":1285804800000},"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":[[2010,9,30]]},"DOI":"10.1145\/1863523.1863535","type":"proceedings-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T13:41:50Z","timestamp":1285681310000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Seq no more"],"prefix":"10.1145","author":[{"given":"Simon","family":"Marlow","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Patrick","family":"Maier","sequence":"additional","affiliation":[{"name":"Heriot-Watt University, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Hans-Wolfgang","family":"Loidl","sequence":"additional","affiliation":[{"name":"Heriot-Watt University, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Mustafa K.","family":"Aswad","sequence":"additional","affiliation":[{"name":"Heriot-Watt University, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Phil","family":"Trinder","sequence":"additional","affiliation":[{"name":"Heriot-Watt University, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocab":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9,30]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"112","volume-title":"TFP '09 - Draft Proc. of Symp. on Trends in Functional Programming","author":"Aswad M. K.","year":"2009","unstructured":"}} M. K. Aswad , P. W. Trinder , A. D. Al Zain , G. J. Michaelson , and J. Berthold . Low pain vs no pain multi-core Haskells . In TFP '09 - Draft Proc. of Symp. on Trends in Functional Programming , pages 112 -- 130 , Komarno, Slovakia , June 2009 . }}M. K. Aswad, P. W. Trinder, A. D. Al Zain, G. J. Michaelson, and J. Berthold. Low pain vs no pain multi-core Haskells. In TFP '09 - Draft Proc. of Symp. on Trends in Functional Programming, pages 112--130, Komarno, Slovakia, June 2009."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351256"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248652"},{"key":"e_1_3_2_2_5_1","volume-title":"Algorithmic Skeletons: Structured Management of Parallel Computation","author":"Cole M. I.","year":"1989","unstructured":"}} M. I. Cole . Algorithmic Skeletons: Structured Management of Parallel Computation . MIT Press & Pitman , 1989 . }}M. I. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press & Pitman, 1989."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626403001379"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/555854"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291192"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088348.1088354"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596649"},{"key":"e_1_3_2_2_11_1","volume-title":"Engineering parallel symbolic programs in GpH. Concurrency - Practice and Experience, 11 (12): 701--752","author":"Loidl H.-W.","year":"1999","unstructured":"}} H.-W. Loidl , P. W. Trinder , K. Hammond , S. B. Junaidu , R. G. Morgan , and S. L. Peyton Jones . Engineering parallel symbolic programs in GpH. Concurrency - Practice and Experience, 11 (12): 701--752 , 1999 . }}H.-W. Loidl, P. W. Trinder, K. Hammond, S. B. Junaidu, R. G. Morgan, and S. L. Peyton Jones. Engineering parallel symbolic programs in GpH. Concurrency - Practice and Experience, 11 (12): 701--752, 1999."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626401000737"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005526"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596563"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.86103"},{"key":"e_1_3_2_2_17_1","volume-title":"Implicit Parallel Programming in pH","author":"Nikhil R. S.","year":"2001","unstructured":"}} R. S. Nikhil and Arvind. Implicit Parallel Programming in pH . Morgan Kaufmann Publishers , 2001 . }}R. S. Nikhil and Arvind. Implicit Parallel Programming in pH. Morgan Kaufmann Publishers, 2001."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806603"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005489"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002967"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004343"}],"event":{"name":"ICFP '10: ACM SIGPLAN International Conference on Functional Programming","location":"Baltimore Maryland USA","acronym":"ICFP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the third ACM Haskell symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863523.1863535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1863523.1863535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:39:52Z","timestamp":1750232392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863523.1863535"}},"subtitle":["better strategies for parallel Haskell"],"short-title":[],"issued":{"date-parts":[[2010,9,30]]},"references-count":21,"alternative-id":["10.1145\/1863523.1863535","10.1145\/1863523"],"URL":"https:\/\/doi.org\/10.1145\/1863523.1863535","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2088456.1863535","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,9,30]]},"assertion":[{"value":"2010-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}