{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:04Z","timestamp":1772164024068,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T00:00:00Z","timestamp":1347494400000},"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":[[2012,9,13]]},"DOI":"10.1145\/2364506.2364511","type":"proceedings-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T09:01:27Z","timestamp":1347440487000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Guiding parallel array fusion with indexed types"],"prefix":"10.1145","author":[{"given":"Ben","family":"Lippmeier","sequence":"first","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Manuel","family":"Chakravarty","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Gabriele","family":"Keller","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research Ltd, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2012,9,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795698.798430"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040306"},{"key":"e_1_3_2_1_3_1","volume-title":"The Coq Proof Assistant Reference Manual Version 8.3","year":"2012","unstructured":"Coq. The Coq Proof Assistant Reference Manual Version 8.3 , 2012 . URL http:\/\/coq.inria.fr. Coq. The Coq Proof Assistant Reference Manual Version 8.3, 2012. URL http:\/\/coq.inria.fr."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596649"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1994.109"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281700.1281702"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034675.2034684"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291194"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481861.1481862"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232630"},{"key":"e_1_3_2_1_12_1","volume-title":"Haskell Workshop. ACM","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 optimsiation technique in GHC . In Haskell Workshop. ACM , 2001 . S. L. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: Rewriting as a practical optimsiation technique in GHC. In Haskell Workshop. ACM, 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"Parallel Programming using C++","author":"Reynders J.","year":"1996","unstructured":"J. Reynders , J. C. Cummings , P. J. Hinker , M. Tholburn , S. Banerjee , M. Srikant , S. Karmesin , S. Atlas , S. Keahey , and W. F. Humphrey . Pooma: A framework for scientific simulation on parallel architectures . In Parallel Programming using C++ . MIT Press , 1996 . J. Reynders, J. C. Cummings, P. J. Hinker, M. Tholburn, S. Banerjee, M. Srikant, S. Karmesin, S. Atlas, S. Keahey, and W. F. Humphrey. Pooma: A framework for scientific simulation on parallel architectures. In Parallel Programming using C++. MIT Press, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73562"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/63047.63073"},{"key":"e_1_3_2_1_16_1","volume-title":"Trends in Functional Programming","author":"Snyder M.","year":"2010","unstructured":"M. Snyder and P. Alexander . Monad factory: Type-indexed monads . In Trends in Functional Programming . Springer , 2010 . M. Snyder and P. Alexander. Monad factory: Type-indexed monads. In Trends in Functional Programming. Springer, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drl014"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311548"}],"event":{"name":"ICFP'12: ACM SIGPLAN International Conference on Functional Programming","location":"Copenhagen Denmark","acronym":"ICFP'12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2012 Haskell Symposium"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364506.2364511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2364506.2364511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:33:58Z","timestamp":1750224838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364506.2364511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,13]]},"references-count":18,"alternative-id":["10.1145\/2364506.2364511","10.1145\/2364506"],"URL":"https:\/\/doi.org\/10.1145\/2364506.2364511","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2430532.2364511","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,9,13]]},"assertion":[{"value":"2012-09-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}