{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:53Z","timestamp":1772164013000,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T00:00:00Z","timestamp":1285545600000},"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,27]]},"DOI":"10.1145\/1863543.1863558","type":"proceedings-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T13:41:50Z","timestamp":1285681310000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Lazy tree splitting"],"prefix":"10.1145","author":[{"given":"Lars","family":"Bergstrom","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rainey","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"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":"Adam","family":"Shaw","sequence":"additional","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"}]}],"member":"320","published-online":{"date-parts":[[2010,9,27]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190206"},{"key":"e_1_3_2_2_2_1","volume-title":"Compiling with Continuations","author":"Appel A. W.","year":"1992","unstructured":"}} Appel , A. W. Compiling with Continuations . Cambridge University Press , Cambridge, England , 1992 . }}Appel, A. W. Compiling with Continuations. Cambridge University Press, Cambridge, England, 1992."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380251203"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1038"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232650"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_2_9_1","volume-title":"Vector models for data-parallel computing","author":"Blelloch G. E.","year":"1990","unstructured":"}} Blelloch , G. E. Vector models for data-parallel computing . MIT Press , Cambridge, MA, USA , 1990 . }}Blelloch, G. E. Vector models for data-parallel computing. MIT Press, Cambridge, MA, USA, 1990."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800223.806778"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/169683.174152"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248652"},{"key":"e_1_3_2_2_14_1","volume-title":"Partial Vectorisation of Haskell Programs. In DAMP '08","author":"Chakravarty M. M. T.","year":"2008","unstructured":"}} Chakravarty , M. M. T. , R. Leshchinskiy , S. Peyton Jones , and G. Keller . Partial Vectorisation of Haskell Programs. In DAMP '08 . ACM, January 2008 . }}Chakravarty, M. M. T., R. Leshchinskiy, S. Peyton Jones, and G. Keller. Partial Vectorisation of Haskell Programs. In DAMP '08. ACM, January 2008."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292535.1292539"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248656"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411239"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411224"},{"key":"e_1_3_2_2_20_1","unstructured":"}}Barnes Hut benchmark written in Haskell. Available from http:\/\/darcs.haskell.org\/packages\/ndp\/examples\/barnesHut\/.  }}Barnes Hut benchmark written in Haskell. Available from http:\/\/darcs.haskell.org\/packages\/ndp\/examples\/barnesHut\/."},{"key":"e_1_3_2_2_21_1","volume-title":"Intel","author":"Ghuloum A.","year":"2007","unstructured":"}} Ghuloum , A. , E. Sprangle , J. Fang , G. Wu , and X. Zhou . Ct: A flexible parallel programming model for tera-scale architectures. Technical report , Intel , October 2007 . Available at http:\/\/techresearch.intel.com\/UserFiles\/en-us\/File\/terascale\/Whitepaper-Ct.pdf. }}Ghuloum, A., E. Sprangle, J. Fang, G. Wu, and X. Zhou. Ct: A flexible parallel programming model for tera-scale architectures. Technical report, Intel, October 2007. Available at http:\/\/techresearch.intel.com\/UserFiles\/en-us\/File\/terascale\/Whitepaper-Ct.pdf."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802017"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005769"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002864"},{"key":"e_1_3_2_2_25_1","unstructured":"}}Intel Threading Building Blocks Reference Manual 2008.  }}Intel Threading Building Blocks Reference Manual 2008."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630048"},{"key":"e_1_3_2_2_29_1","first-page":"8","volume-title":"H. W. and K. Hammond. On the Granularity of Divide-and-Conquer Parallelism. In GWFP '95","author":"Loidl","year":"1995","unstructured":"}} Loidl , H. W. and K. Hammond. On the Granularity of Divide-and-Conquer Parallelism. In GWFP '95 . Springer-Verlag , 1995 , pp. 8 -- 10 . }}Loidl, H. W. and K. Hammond. On the Granularity of Divide-and-Conquer Parallelism. In GWFP '95. Springer-Verlag, 1995, pp. 8--10."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328474"},{"key":"e_1_3_2_2_31_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_2_32_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":"}} Milner , R. , M. Tofte , R. Harper , and D. MacQueen . The Definition of Standard ML (Revised) . The MIT Press , Cambridge, MA , 1997 . }}Milner, R., M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, MA, 1997."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/314602.314607"},{"key":"e_1_3_2_2_34_1","volume-title":"MIT","author":"Nikhil R. S.","year":"1991","unstructured":"}} Nikhil , R. S. ID Language Reference Manual. Laboratory for Computer Science , MIT , Cambridge, MA , July 1991 . }}Nikhil, R. S. ID Language Reference Manual. Laboratory for Computer Science, MIT, Cambridge, MA, July 1991."},{"key":"e_1_3_2_2_35_1","volume-title":"The Manticore runtime model. Master's dissertation","author":"Rainey M.","year":"2007","unstructured":"}} Rainey , M. The Manticore runtime model. Master's dissertation , University of Chicago , January 2007 . Available from http:\/\/manticore.cs.uchicago.edu. }}Rainey, M. The Manticore runtime model. Master's dissertation, University of Chicago, January 2007. Available from http:\/\/manticore.cs.uchicago.edu."},{"key":"e_1_3_2_2_36_1","volume-title":"Semantics Engineering with PLT Redex","author":"Rainey M.","year":"2009","unstructured":"}} Rainey , M. Prototyping nested schedulers . In M. Felleisen, R. Findler, and M. Flatt (eds.), Semantics Engineering with PLT Redex . MIT Press , 2009 . }}Rainey, M. Prototyping nested schedulers. In M. Felleisen, R. Findler, and M. Flatt (eds.), Semantics Engineering with PLT Redex. MIT Press, 2009."},{"key":"e_1_3_2_2_37_1","volume-title":"IPDPS '08","author":"Robison A.","year":"2008","unstructured":"}} Robison , A. , M. Voss , and A. Kukanov . Optimization via Reflection on Work Stealing in TBB . In IPDPS '08 . IEEE Computer Society Press , 2008 . }}Robison, A., M. Voss, and A. Kukanov. Optimization via Reflection on Work Stealing in TBB. In IPDPS '08. IEEE Computer Society Press, 2008."},{"key":"e_1_3_2_2_38_1","unstructured":"}}Scandal Project. A library of parallel algorithms written NESL. Available from http:\/\/www.cs.cmu.edu\/~scandal\/nesl\/algorithms.html.  }}Scandal Project. A library of parallel algorithms written NESL. Available from http:\/\/www.cs.cmu.edu\/~scandal\/nesl\/algorithms.html."},{"key":"e_1_3_2_2_39_1","volume-title":"STMCS '06","author":"So B.","year":"2006","unstructured":"}} So , B. , A. Ghuloum , and Y. Wu . Optimizing data parallel operations on many-core platforms . In STMCS '06 , 2006 . }}So, B., A. Ghuloum, and Y. Wu. Optimizing data parallel operations on many-core platforms. In STMCS '06, 2006."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693479"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002967"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/193645.190355"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159877"}],"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 15th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863543.1863558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1863543.1863558","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\/1863543.1863558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,27]]},"references-count":40,"alternative-id":["10.1145\/1863543.1863558","10.1145\/1863543"],"URL":"https:\/\/doi.org\/10.1145\/1863543.1863558","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1932681.1863558","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,9,27]]},"assertion":[{"value":"2010-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}