{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:06Z","timestamp":1772164026290,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"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,2,23]]},"DOI":"10.1145\/2442516.2442525","type":"proceedings-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T10:23:04Z","timestamp":1361874184000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Data-only flattening for nested data parallelism"],"prefix":"10.1145","author":[{"given":"Lars","family":"Bergstrom","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Fluet","sequence":"additional","affiliation":[{"name":"Rochester Institute of Technology, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rainey","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Reppy","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Rosen","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Shaw","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863558"},{"key":"e_1_3_2_1_2_1","volume-title":"Vector models for data-parallel computing","author":"Blelloch G. E.","year":"1990","unstructured":"G. E. Blelloch . Vector models for data-parallel computing . MIT Press , Cambridge, MA, USA , 1990 . G. E. Blelloch. Vector models for data-parallel computing. MIT Press, Cambridge, MA, USA, 1990."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90087-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380251203"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351249"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"524","volume-title":"Euro-Par '01","author":"Chakravarty M. M. T.","year":"2001","unstructured":"M. M. T. Chakravarty , G. Keller , R. Leshchinskiy , and W. Pfannenstiel . Nepal -- nested data parallelism in Haskell . In Euro-Par '01 , volume 2150 of LNCS , pages 524 -- 534 , New York, NY , Aug. 2001 . Springer-Verlag . M. M. T. Chakravarty, G. Keller, R. Leshchinskiy, and W. Pfannenstiel. Nepal -- nested data parallelism in Haskell. In Euro-Par '01, volume 2150 of LNCS, pages 524--534, New York, NY, Aug. 2001. Springer-Verlag."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248652"},{"key":"e_1_3_2_1_10_1","first-page":"137","volume-title":"OSDI '04","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In OSDI '04 , pages 137 -- 150 , Berkeley, CA , Dec. 2004 . USENIX Association. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI '04, pages 137--150, Berkeley, CA, Dec. 2004. USENIX Association."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292535.1292539"},{"key":"e_1_3_2_1_12_1","unstructured":"GHC. The Glasgow Haskell Compiler. Available from http:\/\/www.haskell.org\/ghc.  GHC. The Glasgow Haskell Compiler. Available from http:\/\/www.haskell.org\/ghc."},{"key":"e_1_3_2_1_13_1","volume-title":"Technische Universitat Berlin","author":"Keller G.","year":"1999","unstructured":"G. Keller . Transformation-based Implementation of Nested Data Parallelism for Distributed Memory Machines. PhD thesis , Technische Universitat Berlin , Berlin, Germany , 1999 . G. Keller. Transformation-based Implementation of Nested Data Parallelism for Distributed Memory Machines. PhD thesis, Technische Universitat Berlin, Berlin, Germany, 1999."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646663.699972"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364512"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_122"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"Milner R.","year":"1997","unstructured":"R. Milner , M. Tofte , R. Harper , and D. MacQueen . The Definition of Standard ML (Revised) . The MIT Press , Cambridge, MA , 1997 . R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, MA, 1997."},{"key":"e_1_3_2_1_18_1","unstructured":"MLton. The MLton Standard ML compiler. Available at http:\/\/mlton.org.  MLton. The MLton Standard ML compiler. Available at http:\/\/mlton.org."},{"key":"e_1_3_2_1_19_1","volume-title":"MIT","author":"Nikhil R. S.","year":"1991","unstructured":"R. S. Nikhil . ID Language Reference Manual. Laboratory for Computer Science , MIT , Cambridge, MA , July 1991 . R. S. Nikhil. ID Language Reference Manual. Laboratory for Computer Science, MIT, Cambridge, MA, July 1991."},{"key":"e_1_3_2_1_20_1","first-page":"186","volume-title":"FoMPP5","author":"Palmer D. W.","year":"1995","unstructured":"D. W. Palmer , J. F. Prins , and S. Westfold . Work-efficient nested dataparallelism . In FoMPP5 , pages 186 -- 193 , Los Alamitos, CA , 1995 . IEEE Computer Society Press . D. W. Palmer, J. F. Prins, and S. Westfold. Work-efficient nested dataparallelism. In FoMPP5, pages 186--193, Los Alamitos, CA, 1995. IEEE Computer Society Press."},{"key":"e_1_3_2_1_21_1","first-page":"203","volume-title":"Proceedings of the 2001 Haskell Workshop","author":"Peyton Jones S.","year":"2001","unstructured":"S. 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 , pages 203 -- 233 , Sept. 2001 . S. 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, pages 203--233, Sept. 2001."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89330-1_10"},{"key":"e_1_3_2_1_23_1","volume-title":"University of Chicago","author":"Rainey M.","year":"2010","unstructured":"M. Rainey . Effective Scheduling Techniques for High-Level Parallel Programming Languages. PhD thesis , University of Chicago , Aug. 2010 . Available from http:\/\/manticore.cs.uchicago.edu. M. Rainey. Effective Scheduling Techniques for High-Level Parallel Programming Languages. PhD thesis, University of Chicago, Aug. 2010. Available from http:\/\/manticore.cs.uchicago.edu."},{"key":"e_1_3_2_1_24_1","first-page":"97","volume-title":"GH '07","author":"Sengupta S.","year":"2007","unstructured":"S. Sengupta , M. Harris , Y. Zhang , and J. D. Owens . Scan primitives for GPU computing . In GH '07 , pages 97 -- 106 , Aire-la-Ville, Switzerland , Aug. 2007 . Eurographics Association. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan primitives for GPU computing. In GH '07, pages 97--106, Aire-la-Ville, Switzerland, Aug. 2007. Eurographics Association."},{"key":"e_1_3_2_1_25_1","volume-title":"University of Chicago","author":"Shaw A.","year":"2011","unstructured":"A. Shaw . Implementation techniques for nested-data-parallel languages. PhD thesis , University of Chicago , Aug. 2011 . Available from http:\/\/manticore.cs.uchicago.edu. A. Shaw. Implementation techniques for nested-data-parallel languages. PhD thesis, University of Chicago, Aug. 2011. Available from http:\/\/manticore.cs.uchicago.edu."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411240"}],"event":{"name":"PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Shenzhen China","acronym":"PPoPP '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442516.2442525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:06Z","timestamp":1750220346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":25,"alternative-id":["10.1145\/2442516.2442525","10.1145\/2442516"],"URL":"https:\/\/doi.org\/10.1145\/2442516.2442525","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2517327.2442525","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,2,23]]},"assertion":[{"value":"2013-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}