{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T14:58:43Z","timestamp":1787065123547,"version":"3.56.0"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1901381,CCF-2107241,CCF-2119352,CCF-2115104"],"award-info":[{"award-number":["CCF-1901381,CCF-2107241,CCF-2119352,CCF-2115104"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2022,8,29]]},"abstract":"<jats:p>Recent research on parallel functional programming has culminated in a provably efficient (in work and space) parallel memory manager, which has been incorporated into the MPL (MaPLe) compiler for Parallel ML and shown to deliver practical efficiency and scalability. The memory manager exploits a property of parallel programs called disentanglement, which restricts computations from accessing concurrently allocated objects. Disentanglement is closely related to race-freedom, but subtly differs from it. Unlike race-freedom, however, no known techniques exists for ensuring disentanglement, leaving the task entirely to the programmer. This is a challenging task, because it requires reasoning about low-level memory operations (e.g., allocations and accesses), which is especially difficult in functional languages.<\/jats:p>\n                  <jats:p>In this paper, we present techniques for detecting entanglement dynamically, while the program is running. We first present a dynamic semantics for a functional language with references that checks for entanglement by consulting parallel and sequential dependency relations in the program. Notably, the semantics requires checks for mutable objects only. We prove the soundness of the dynamic semantics and present several techniques for realizing it efficiently, in particular by pruning away a large number of entanglement checks. We also provide bounds on the work and space of our techniques.<\/jats:p>\n                  <jats:p>We show that the entanglement detection techniques are practical by implementing them in the MPL compiler for Parallel ML. Considering a variety of benchmarks, we present an evaluation and measure time and space overheads of less than 5% on average with up to 72 cores. These results show that entanglement detection has negligible cost and can therefore remain deployed with little or no impact on efficiency, scalability, and space.<\/jats:p>","DOI":"10.1145\/3547646","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T15:39:26Z","timestamp":1661960366000},"page":"679-710","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Entanglement detection with near-zero cost"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2848-9808","authenticated-orcid":false,"given":"Sam","family":"Westrick","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8302-6844","authenticated-orcid":false,"given":"Jatin","family":"Arora","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-4986","authenticated-orcid":false,"given":"Umut A.","family":"Acar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,8,31]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Umut A. Acar Guy Blelloch Matthew Fluet Stefan K. Muller and Ram Raghunathan. 2015. Coupling Memory and Computation for Locality Management. In Summit on Advances in Programming Languages (SNAPL). \t\t\t\t  Umut A. Acar Guy Blelloch Matthew Fluet Stefan K. Muller and Ram Raghunathan. 2015. Coupling Memory and Computation for Locality Management. In Summit on Advances in Programming Languages (SNAPL)."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839676.1839697"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508422"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806651.1806655"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/66382.66387"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680000157X"},{"key":"e_1_2_2_8_1","volume-title":"Proceedings of the 48th Annual ACM Symposium on Principles of Programming Languages (POPL)\".","author":"Arora Jatin","unstructured":"Jatin Arora , Sam Westrick , and Umut A. Acar . 2021. Provably Space Efficient Parallel Functional Programming . In Proceedings of the 48th Annual ACM Symposium on Principles of Programming Languages (POPL)\". Jatin Arora, Sam Westrick, and Umut A. Acar. 2021. Provably Space Efficient Parallel Functional Programming. In Proceedings of the 48th Annual ACM Symposium on Principles of Programming Languages (POPL)\"."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-0004-z"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/69558.69562"},{"key":"e_1_2_2_11_1","volume-title":"Proceedings of the 2011 ACM SIGPLAN workshop on Memory Systems Performance and Correctness (MSPC). 51\u201357","author":"Auhagen Sven","unstructured":"Sven Auhagen , Lars Bergstrom , Matthew Fluet , and John H. Reppy . 2011. Garbage collection for multicore NUMA machines . In Proceedings of the 2011 ACM SIGPLAN workshop on Memory Systems Performance and Correctness (MSPC). 51\u201357 . Sven Auhagen, Lars Bergstrom, Matthew Fluet, and John H. Reppy. 2011. Garbage collection for multicore NUMA machines. In Proceedings of the 2011 ACM SIGPLAN workshop on Memory Systems Performance and Correctness (MSPC). 51\u201357."},{"key":"e_1_2_2_12_1","volume-title":"On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133\u2013144","author":"Bender Michael A.","unstructured":"Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , and Charles E. Leiserson . 2004 . On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133\u2013144 . Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Charles E. Leiserson. 2004. On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133\u2013144."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_2_2_15_1","volume-title":"Blelloch and Perry Cheng","author":"Guy","year":"1999","unstructured":"Guy E. Blelloch and Perry Cheng . 1999 . On Bounding Time and Space for Multiprocessor Garbage Collection. In Proceedings of SIGPLAN\u201999 Conference on Programming Languages Design and Implementation (ACM SIGPLAN Notices). ACM Press , Atlanta. 104\u2013117. Guy E. Blelloch and Perry Cheng. 1999. On Bounding Time and Space for Multiprocessor Garbage Collection. In Proceedings of SIGPLAN\u201999 Conference on Programming Languages Design and Implementation (ACM SIGPLAN Notices). ACM Press, Atlanta. 104\u2013117."},{"key":"e_1_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons and Julian Shun. 2012. Internally deterministic parallel algorithms can be fast. In PPoPP \u201912. 181\u2013192. \t\t\t\t  Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons and Julian Shun. 2012. Internally deterministic parallel algorithms can be fast. In PPoPP \u201912. 181\u2013192.","DOI":"10.1145\/2370036.2145840"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1038"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855591.1855595"},{"key":"e_1_2_2_21_1","volume-title":"3rd USENIX Workshop on Hot Topics in Parallelism, HotPar\u201911","author":"Boehm Hans-Juergen","year":"2011","unstructured":"Hans-Juergen Boehm . 2011 . How to Miscompile Programs with \"Benign\" Data Races . In 3rd USENIX Workshop on Hot Topics in Parallelism, HotPar\u201911 , Berkeley, CA, USA , May 26-27, 2011. Hans-Juergen Boehm. 2011. How to Miscompile Programs with \"Benign\" Data Races. In 3rd USENIX Workshop on Hot Topics in Parallelism, HotPar\u201911, Berkeley, CA, USA, May 26-27, 2011."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248652"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_2_2_24_1","volume-title":"Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201998)","author":"Cheng Guang-Ien","unstructured":"Guang-Ien Cheng , Mingdong Feng , Charles E. Leiserson , Keith H. Randall , and Andrew F. Stark . 1998. Detecting data races in Cilk programs that use locks . In Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201998) . Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, and Andrew F. Stark. 1998. Detecting data races in Cilk programs that use locks. In Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201998)."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378823"},{"key":"e_1_2_2_26_1","volume-title":"Unobtrusive Garbage Collection for Multiprocessor Systems. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press","author":"Doligez Damien","year":"1994","unstructured":"Damien Doligez and Georges Gonthier . 1994 . Portable , Unobtrusive Garbage Collection for Multiprocessor Systems. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press , Portland, OR. ftp:\/\/ftp.inria.fr\/INRIA\/Projects\/para\/doligez\/DoligezGonthier94.ps.gz Damien Doligez and Georges Gonthier. 1994. Portable, Unobtrusive Garbage Collection for Multiprocessor Systems. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press, Portland, OR. ftp:\/\/ftp.inria.fr\/INRIA\/Projects\/para\/doligez\/DoligezGonthier94.ps.gz"},{"key":"e_1_2_2_27_1","volume-title":"Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press, 113\u2013123","author":"Doligez Damien","year":"1993","unstructured":"Damien Doligez and Xavier Leroy . 1993 . A Concurrent Generational Garbage Collector for a Multi-Threaded Implementation of ML . In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press, 113\u2013123 . file:\/\/ftp.inria.fr\/INRIA\/Projects\/cristal\/Xavier.Leroy\/publications\/concurrent-gc.ps.gz Damien Doligez and Xavier Leroy. 1993. A Concurrent Generational Garbage Collector for a Multi-Threaded Implementation of ML. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages (ACM SIGPLAN Notices). ACM Press, 113\u2013123. file:\/\/ftp.inria.fr\/INRIA\/Projects\/cristal\/Xavier.Leroy\/publications\/concurrent-gc.ps.gz"},{"key":"e_1_2_2_28_1","volume-title":"Thread-Local Heaps for Java. In ISMM\u201902 Proceedings of the Third International Symposium on Memory Management, David Detlefs (Ed.) (ACM SIGPLAN Notices). ACM Press","author":"Domani Tamar","year":"2002","unstructured":"Tamar Domani , Elliot K. Kolodner , Ethan Lewis , Erez Petrank , and Dafna Sheinwald . 2002 . Thread-Local Heaps for Java. In ISMM\u201902 Proceedings of the Third International Symposium on Memory Management, David Detlefs (Ed.) (ACM SIGPLAN Notices). ACM Press , Berlin. 76\u201387. http:\/\/www.cs.technion.ac.il\/~erez\/publications.html Tamar Domani, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, and Dafna Sheinwald. 2002. Thread-Local Heaps for Java. In ISMM\u201902 Proceedings of the Third International Symposium on Memory Management, David Detlefs (Ed.) (ACM SIGPLAN Notices). ACM Press, Berlin. 76\u201387. http:\/\/www.cs.technion.ac.il\/~erez\/publications.html"},{"key":"e_1_2_2_29_1","volume-title":"Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1\u201311","author":"Feng Mingdong","unstructured":"Mingdong Feng and Charles E. Leiserson . 1997. Efficient Detection of Determinacy Races in Cilk Programs . In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1\u201311 . Mingdong Feng and Charles E. Leiserson. 1997. Efficient Detection of Determinacy Races in Cilk Programs. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1\u201311."},{"key":"e_1_2_2_30_1","volume-title":"Provably Good Race Detection That Runs in Parallel. Master\u2019s thesis","author":"Fineman Jeremy T.","unstructured":"Jeremy T. Fineman . 2005. Provably Good Race Detection That Runs in Parallel. Master\u2019s thesis . Massachusetts Institute of Technology , Department of Electrical Engineering and Computer Science. Cambridge, MA. Jeremy T. Fineman. 2005. Provably Good Race Detection That Runs in Parallel. Master\u2019s thesis. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science. Cambridge, MA."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542490"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411239"},{"key":"e_1_2_2_33_1","first-page":"5","article-title":"Implicitly threaded parallelism in Manticore","volume":"20","author":"Fluet Matthew","year":"2011","unstructured":"Matthew Fluet , Mike Rainey , John Reppy , and Adam Shaw . 2011 . Implicitly threaded parallelism in Manticore . Journal of Functional Programming , 20 , 5 - 6 (2011), 1\u201340. Matthew Fluet, Mike Rainey, John Reppy, and Adam Shaw. 2011. Implicitly threaded parallelism in Manticore. Journal of Functional Programming, 20, 5-6 (2011), 1\u201340.","journal-title":"Journal of Functional Programming"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_2_2_35_1","volume-title":"Lucassen","author":"Gifford David K.","year":"1986","unstructured":"David K. Gifford and John M . Lucassen . 1986 . Integrating Functional and Imperative Programming. In Proceedings of the ACM Symposium on Lisp and Functional Programming (LFP). ACM Press , 22\u201338. David K. Gifford and John M. Lucassen. 1986. Integrating Functional and Imperative Programming. In Proceedings of the ACM Symposium on Lisp and Functional Programming (LFP). ACM Press, 22\u201338."},{"key":"e_1_2_2_36_1","volume-title":"Cache Performance of Programs with Intensive Heap Allocation and Generational Garbage Collection. Ph. D. Dissertation. Department of Computer Science","author":"Gon\u00e7alves Marcelo J. R.","unstructured":"Marcelo J. R. Gon\u00e7alves . 1995. Cache Performance of Programs with Intensive Heap Allocation and Generational Garbage Collection. Ph. D. Dissertation. Department of Computer Science , Princeton University . Marcelo J. R. Gon\u00e7alves. 1995. Cache Performance of Programs with Intensive Heap Allocation and Generational Garbage Collection. Ph. D. Dissertation. Department of Computer Science, Princeton University."},{"key":"e_1_2_2_37_1","volume-title":"Cache Performance of Fast-Allocating Programs. In Record of the 1995 Conference on Functional Programming and Computer Architecture.","author":"Marcelo J.","unstructured":"Marcelo J. R. Gon\u00e7alves and Andrew W. Appel. 1995 . Cache Performance of Fast-Allocating Programs. In Record of the 1995 Conference on Functional Programming and Computer Architecture. Marcelo J. R. Gon\u00e7alves and Andrew W. Appel. 1995. Cache Performance of Fast-Allocating Programs. In Record of the 1995 Conference on Functional Programming and Computer Architecture."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178494"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802017"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21338-0_17"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2647508.2647514"},{"key":"e_1_2_2_42_1","unstructured":"2009. Intel Cilk++ SDK Programmer\u2019s Guide. Document Number: 322581-001US \t\t\t\t  2009. Intel Cilk++ SDK Programmer\u2019s Guide. Document Number: 322581-001US"},{"key":"e_1_2_2_43_1","unstructured":"2009. Intel(R) Threading Building Blocks. Available from http:\/\/www.threadingbuildingblocks.org\/documentation.php \t\t\t\t  2009. Intel(R) Threading Building Blocks. Available from http:\/\/www.threadingbuildingblocks.org\/documentation.php"},{"key":"e_1_2_2_44_1","volume-title":"The garbage collection handbook: the art of automatic memory management","author":"Jones Richard","unstructured":"Richard Jones , Antony Hosking , and Eliot Moss . 2011. The garbage collection handbook: the art of automatic memory management . Chapman & Hall\/CRC. Richard Jones, Antony Hosking, and Eliot Moss. 2011. The garbage collection handbook: the art of automatic memory management. Chapman & Hall\/CRC."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863582"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062374"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502323.2502326"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594312"},{"key":"e_1_2_2_49_1","volume-title":"Proceedings of the ACM SIGPLAN\u201994 Conference on Programming Language Design and Implementation (PLDI)","author":"Launchbury John","year":"1994","unstructured":"John Launchbury and Simon L . Peyton Jones. 1994. Lazy Functional State Threads . In Proceedings of the ACM SIGPLAN\u201994 Conference on Programming Language Design and Implementation (PLDI) , Orlando, Florida, USA , June 20-24, 1994 . 24\u201335. John Launchbury and Simon L. Peyton Jones. 1994. Lazy Functional State Threads. In Proceedings of the ACM SIGPLAN\u201994 Conference on Programming Language Design and Implementation (PLDI), Orlando, Florida, USA, June 20-24, 1994. 24\u201335."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784736"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_2_2_52_1","volume-title":"Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007","author":"Li Peng","year":"2007","unstructured":"Peng Li , Simon Marlow , Simon L. Peyton Jones , and Andrew P. Tolmach . 2007. Lightweight concurrency primitives for GHC . In Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007 , Freiburg, Germany , September 30, 2007 . 107\u2013118. Peng Li, Simon Marlow, Simon L. Peyton Jones, and Andrew P. Tolmach. 2007. Lightweight concurrency primitives for GHC. In Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007, Freiburg, Germany, September 30, 2007. 107\u2013118."},{"key":"e_1_2_2_53_1","volume-title":"Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201988)","author":"Lucassen J. M.","unstructured":"J. M. Lucassen and D. K. Gifford . 1988. Polymorphic Effect Systems . In Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201988) . ACM, New York, NY, USA. 47\u201357. isbn:0-89791-252-7 J. M. Lucassen and D. K. Gifford. 1988. Polymorphic Effect Systems. In Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201988). ACM, New York, NY, USA. 47\u201357. isbn:0-89791-252-7"},{"key":"e_1_2_2_54_1","volume-title":"Proceedings of the 10th International Symposium on Memory Management, ISMM 2011","author":"Marlow Simon","year":"2011","unstructured":"Simon Marlow and Simon L . Peyton Jones. 2011. Multicore garbage collection with local heaps . In Proceedings of the 10th International Symposium on Memory Management, ISMM 2011 , San Jose, CA, USA, June 04 - 05 , 2011 , Hans-Juergen Boehm and David F. Bacon (Eds.). ACM, 21\u201332. Simon Marlow and Simon L. Peyton Jones. 2011. Multicore garbage collection with local heaps. In Proceedings of the 10th International Symposium on Memory Management, ISMM 2011, San Jose, CA, USA, June 04 - 05, 2011, Hans-Juergen Boehm and David F. Bacon (Eds.). ACM, 21\u201332."},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125861"},{"key":"e_1_2_2_56_1","unstructured":"n.d.. MLton web site. http:\/\/www.mlton.org \t\t\t\t  n.d.. MLton web site. http:\/\/www.mlton.org"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386013"},{"key":"e_1_2_2_58_1","volume-title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA","author":"Stefan","year":"2016","unstructured":"Stefan K. Muller and Umut A. Acar. 2016. Latency-Hiding Work Stealing: Scheduling Interacting Parallel Computations with Work Stealing . In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA , July 11-13, 2016 . 71\u201382. Stefan K. Muller and Umut A. Acar. 2016. Latency-Hiding Work Stealing: Scheduling Interacting Parallel Computations with Work Stealing. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA, July 11-13, 2016. 71\u201382."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062370"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236790"},{"key":"e_1_2_2_61_1","volume-title":"Proceedings of the 24th ACM SIGPLAN International Conference on Functional Programming (ICFP","author":"Muller Stefan K.","year":"2019","unstructured":"Stefan K. Muller , Sam Westrick , and Umut A. Acar . 2019. Fairness in Responsive Parallelism . In Proceedings of the 24th ACM SIGPLAN International Conference on Functional Programming (ICFP 2019 ). Stefan K. Muller, Sam Westrick, and Umut A. Acar. 2019. Fairness in Responsive Parallelism. In Proceedings of the 24th ACM SIGPLAN International Conference on Functional Programming (ICFP 2019)."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781528"},{"key":"e_1_2_2_63_1","unstructured":"Atsushi Ohori Kenjiro Taura and Katsuhiro Ueno. 2018. Making SML# a General-purpose High-performance Language. Unpublished Manuscript \t\t\t\t  Atsushi Ohori Kenjiro Taura and Katsuhiro Ueno. 2018. Making SML# a General-purpose High-performance Language. Unpublished Manuscript"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452048"},{"key":"e_1_2_2_65_1","volume-title":"Chakravarty","author":"Peyton Jones Simon L.","year":"2008","unstructured":"Simon L. Peyton Jones , Roman Leshchinskiy , Gabriele Keller , and Manuel M. T . Chakravarty . 2008 . Harnessing the Multicores : Nested Data Parallelism in Haskell. In FSTTCS. 383\u2013414. Simon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, and Manuel M. T. Chakravarty. 2008. Harnessing the Multicores: Nested Data Parallelism in Haskell. In FSTTCS. 383\u2013414."},{"key":"e_1_2_2_66_1","volume-title":"Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201993)","author":"Simon","unstructured":"Simon L. Peyton Jones and Philip Wadler. 1993. Imperative Functional Programming . In Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201993) . 71\u201384. Simon L. Peyton Jones and Philip Wadler. 1993. Imperative Functional Programming. In Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201993). 71\u201384."},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951935"},{"key":"e_1_2_2_68_1","volume-title":"Notes in Computer Science","author":"Raman Raghavan","unstructured":"Raghavan Raman , Jisheng Zhao , Vivek Sarkar , Martin Vechev , and Eran Yahav . 2010. Efficient Data Race Detection for Async-Finish Parallelism . In Runtime Verification, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, Gordon Pace, Grigore Rosu, Oleg Sokolsky, and Nikolai Tillmann (Eds.) (Lecture Notes in Computer Science , Vol. 6418). Springer Berlin \/ Heidelberg, 368\u2013 383 . isbn:978-3-642-16611-2 Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin Vechev, and Eran Yahav. 2010. Efficient Data Race Detection for Async-Finish Parallelism. In Runtime Verification, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, Gordon Pace, Grigore Rosu, Oleg Sokolsky, and Nikolai Tillmann (Eds.) (Lecture Notes in Computer Science, Vol. 6418). Springer Berlin \/ Heidelberg, 368\u2013383. isbn:978-3-642-16611-2"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254127"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512766"},{"key":"e_1_2_2_71_1","unstructured":"Rust Team. 2019. Rust Language. https:\/\/www.rust-lang.org\/ \t\t\t\t  Rust Team. 2019. Rust Language. https:\/\/www.rust-lang.org\/"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266641"},{"key":"e_1_2_2_73_1","volume-title":"Blelloch","author":"Shun Julian","year":"2013","unstructured":"Julian Shun and Guy E . Blelloch . 2013 . Ligra: a lightweight graph processing framework for shared memory. In PPOPP \u201913. ACM, New York, NY, USA. 135\u2013146. Julian Shun and Guy E. Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In PPOPP \u201913. ACM, New York, NY, USA. 135\u2013146."},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976021.11"},{"key":"e_1_2_2_76_1","volume-title":"32nd ACM Symposium on Parallelism in Algorithms and Architectures","author":"Singer Kyle","year":"2020","unstructured":"Kyle Singer , Noah Goldstein , Stefan K. Muller , Kunal Agrawal , I- Ting Angelina Lee , and Umut A. Acar . 2020. Priority Scheduling for Interactive Applications. In SPAA \u201920 : 32nd ACM Symposium on Parallelism in Algorithms and Architectures , Virtual Event, USA , July 15-17, 2020 , Christian Scheideler and Michael Spear (Eds.). 465\u2013477. Kyle Singer, Noah Goldstein, Stefan K. Muller, Kunal Agrawal, I-Ting Angelina Lee, and Umut A. Acar. 2020. Priority Scheduling for Interactive Applications. In SPAA \u201920: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, Christian Scheideler and Michael Spear (Eds.). 465\u2013477."},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295735"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408995"},{"key":"e_1_2_2_79_1","volume-title":"FirstView","author":"Sivaramakrishnan K. C.","year":"2014","unstructured":"K. C. Sivaramakrishnan , Lukasz Ziarek , and Suresh Jagannathan . 2014. MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming , FirstView ( 2014 ), 6, 1\u201362. K. C. Sivaramakrishnan, Lukasz Ziarek, and Suresh Jagannathan. 2014. MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming, FirstView (2014), 6, 1\u201362."},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_2_2_81_1","volume-title":"Scheduling Deterministic Parallel Programs. Ph. D. Dissertation","author":"Spoonhower Daniel","unstructured":"Daniel Spoonhower . 2009. Scheduling Deterministic Parallel Programs. Ph. D. Dissertation . Carnegie Mellon University . https:\/\/www.cs.cmu.edu\/~rwh\/theses\/spoonhower.pdf Daniel Spoonhower. 2009. Scheduling Deterministic Parallel Programs. Ph. D. Dissertation. Carnegie Mellon University. https:\/\/www.cs.cmu.edu\/~rwh\/theses\/spoonhower.pdf"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584019"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178068"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178509"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353445.1353449"},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935801"},{"key":"e_1_2_2_87_1","unstructured":"Sam Westrick Jatin Arora and Umut Acar. 2022. Provably Space-Efficient Parallel Functional Programming. https:\/\/blog.sigplan.org\/2022\/01\/13\/provably-space-efficient-parallel-functional-programming\/ \t\t\t\t  Sam Westrick Jatin Arora and Umut Acar. 2022. Provably Space-Efficient Parallel Functional Programming. https:\/\/blog.sigplan.org\/2022\/01\/13\/provably-space-efficient-parallel-functional-programming\/"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.6671887"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508434"},{"key":"e_1_2_2_90_1","volume-title":"Acar","author":"Westrick Sam","year":"2022","unstructured":"Sam Westrick , Larry Wang , and Umut A . Acar . 2022 . DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism. CoRR , abs\/2204.14168 (2022), https:\/\/doi.org\/10.48550\/arXiv.2204.14168 arXiv:2204.14168. Sam Westrick, Larry Wang, and Umut A. Acar. 2022. DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism. CoRR, abs\/2204.14168 (2022), https:\/\/doi.org\/10.48550\/arXiv.2204.14168 arXiv:2204.14168."},{"key":"e_1_2_2_91_1","volume-title":"Proceedings of the 47th Annual ACM Symposium on Principles of Programming Languages (POPL)\".","author":"Westrick Sam","unstructured":"Sam Westrick , Rohan Yadav , Matthew Fluet , and Umut A. Acar . 2020. Disentanglement in Nested-Parallel Programs . In Proceedings of the 47th Annual ACM Symposium on Principles of Programming Languages (POPL)\". Sam Westrick, Rohan Yadav, Matthew Fluet, and Umut A. Acar. 2020. Disentanglement in Nested-Parallel Programs. In Proceedings of the 47th Annual ACM Symposium on Principles of Programming Languages (POPL)\"."},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374536"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095832"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993572"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3547646","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3547646","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3547646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:43:29Z","timestamp":1750257809000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3547646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":94,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2022,8,29]]}},"alternative-id":["10.1145\/3547646"],"URL":"https:\/\/doi.org\/10.1145\/3547646","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2022-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}