{"id":"https://openalex.org/W4390605321","doi":"https://doi.org/10.1145/3632895","title":"Disentanglement with Futures, State, and Interaction","display_name":"Disentanglement with Futures, State, and Interaction","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390605321","doi":"https://doi.org/10.1145/3632895"},"language":"en","primary_location":{"id":"doi:10.1145/3632895","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632895","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632895","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632895","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035801565","display_name":"Jatin Arora","orcid":"https://orcid.org/0000-0001-8302-6844"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jatin Arora","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0001-8302-6844","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009393339","display_name":"Stefan K. Muller","orcid":"https://orcid.org/0000-0002-3210-9727"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stefan K. Muller","raw_affiliation_strings":["Illinois Institute of Technology, Chicago, USA"],"raw_orcid":"https://orcid.org/0000-0002-3210-9727","affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology, Chicago, USA","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015051107","display_name":"Umut A. Acar","orcid":"https://orcid.org/0000-0002-2623-4986"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umut A. Acar","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0002-2623-4986","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00387168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"POPL","first_page":"1569","last_page":"1599"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8146162033081055},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.6844438314437866},{"id":"https://openalex.org/keywords/stateful-firewall","display_name":"Stateful firewall","score":0.6564744114875793},{"id":"https://openalex.org/keywords/futures-contract","display_name":"Futures contract","score":0.6187921166419983},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5080845355987549},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47957080602645874},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4537352919578552},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4417254626750946},{"id":"https://openalex.org/keywords/implicit-parallelism","display_name":"Implicit parallelism","score":0.4331973195075989},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.425041139125824},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4035319685935974},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.2882031202316284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8146162033081055},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.6844438314437866},{"id":"https://openalex.org/C22927095","wikidata":"https://www.wikidata.org/wiki/Q1784206","display_name":"Stateful firewall","level":3,"score":0.6564744114875793},{"id":"https://openalex.org/C106306483","wikidata":"https://www.wikidata.org/wiki/Q183984","display_name":"Futures contract","level":2,"score":0.6187921166419983},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5080845355987549},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47957080602645874},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4537352919578552},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4417254626750946},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.4331973195075989},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.425041139125824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4035319685935974},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.2882031202316284},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3632895","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632895","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632895","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3632895","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632895","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632895","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1562374711","display_name":"SHF: Small: Solving the Parallel Functional Programming Challenge","funder_award_id":"2115104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5360328037","display_name":"Collaborative Research: PPoSS: LARGE: Unifying Software and Hardware to Achieve Performant and Scalable Frictionless Parallelism in the Heterogeneous Future","funder_award_id":"2119352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G753685075","display_name":"Collaborative Research: SHF: Medium: Responsive Parallelism for Interactive Applications: Theory and Practice","funder_award_id":"2107241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390605321.pdf","grobid_xml":"https://content.openalex.org/works/W4390605321.grobid-xml"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W92412884","https://openalex.org/W606382780","https://openalex.org/W1577551647","https://openalex.org/W1583642359","https://openalex.org/W1963506672","https://openalex.org/W1971181882","https://openalex.org/W1972174903","https://openalex.org/W1975579741","https://openalex.org/W1978583881","https://openalex.org/W1983587324","https://openalex.org/W1994257154","https://openalex.org/W1995689755","https://openalex.org/W1995873479","https://openalex.org/W1999241319","https://openalex.org/W2006795057","https://openalex.org/W2016323637","https://openalex.org/W2018377917","https://openalex.org/W2032401773","https://openalex.org/W2034256728","https://openalex.org/W2043003055","https://openalex.org/W2059259057","https://openalex.org/W2066952803","https://openalex.org/W2072725684","https://openalex.org/W2080570636","https://openalex.org/W2095951614","https://openalex.org/W2105794846","https://openalex.org/W2115968584","https://openalex.org/W2118973181","https://openalex.org/W2121783057","https://openalex.org/W2125650214","https://openalex.org/W2127989655","https://openalex.org/W2163496769","https://openalex.org/W2170200862","https://openalex.org/W2470978318","https://openalex.org/W2472681217","https://openalex.org/W2507118912","https://openalex.org/W2508222108","https://openalex.org/W2563217728","https://openalex.org/W2606910946","https://openalex.org/W2624869780","https://openalex.org/W2763271584","https://openalex.org/W2783280912","https://openalex.org/W2798644064","https://openalex.org/W2911748475","https://openalex.org/W2914299639","https://openalex.org/W2965448248","https://openalex.org/W2995576800","https://openalex.org/W2995593132","https://openalex.org/W3007400938","https://openalex.org/W3033203490","https://openalex.org/W3041246805","https://openalex.org/W3046730857","https://openalex.org/W3098874119","https://openalex.org/W3114438252","https://openalex.org/W4230609379","https://openalex.org/W4236306709","https://openalex.org/W4238347373","https://openalex.org/W4238388226","https://openalex.org/W4240363966","https://openalex.org/W4244157805","https://openalex.org/W4248655060","https://openalex.org/W4248901744","https://openalex.org/W4293812587","https://openalex.org/W4321496333","https://openalex.org/W4376272906","https://openalex.org/W4379536863","https://openalex.org/W4379537137","https://openalex.org/W6649120592"],"related_works":["https://openalex.org/W2152706324","https://openalex.org/W2003935582","https://openalex.org/W132745993","https://openalex.org/W74409296","https://openalex.org/W2950520577","https://openalex.org/W1554644772","https://openalex.org/W2105992728","https://openalex.org/W2074802267","https://openalex.org/W2385520242","https://openalex.org/W305742777"],"abstract_inverted_index":{"Recent":[0],"work":[1,50],"has":[2],"proposed":[3],"a":[4,19,80,174,188,253],"memory":[5],"property":[6],"for":[7,58,204],"parallel":[8,45,77,95,136,313],"programs,":[9,22,258],"called":[10],"disentanglement,":[11,52],"and":[12,33,60,103,108,168,181,185,206,231,256,265,294],"showed":[13,34],"that":[14,35,187,208,233,246,261,276,298,309],"it":[15,36],"is":[16,73,144,249],"pervasive":[17],"in":[18,24,115,123,128,155,194,213,223],"variety":[20],"of":[21,44,100,131,159,191,285,321],"written":[23,193,212,280],"different":[25],"languages,":[26],"ranging":[27],"from":[28],"C/C++":[29],"to":[30,40,64,70,170,290,312],"Parallel":[31],"ML,":[32],"can":[37,105,140,299],"be":[38,106,163,271,300],"exploited":[39],"improve":[41],"the":[42,55,66,101,129,156,295,319],"performance":[43],"functional":[46,175,210],"programs.":[47],"All":[48],"existing":[49],"on":[51],"however,":[53],"considers":[54],"\u201cfork/join\u201d":[56],"model":[57],"parallelism":[59],"does":[61],"not":[62,74,252],"apply":[63],"\u201cfutures\u201d,":[65],"more":[67],"powerful":[68],"approach":[69],"parallelism.":[71,148,328],"This":[72],"surprising:":[75],"fork/join":[76,166],"programs":[78,137,192,211,235,279,314],"exhibit":[79],"reasonably":[81],"strict":[82],"dependency":[83,125],"structure":[84],"(e.g.,":[85],"series-parallel":[86],"DAGs),":[87],"which":[88,143,287],"disentanglement":[89,161,203,310,322],"exploits.":[90],"In":[91,149],"contrast,":[92],"with":[93,138,146,177,281,302,315],"futures,":[94,178],"computations":[96],"become":[97],"first-class":[98],"values":[99],"language,":[102],"thus":[104],"created,":[107],"passed":[109],"between":[110,292],"functions":[111],"calls":[112],"or":[113],"stored":[114],"memory,":[116],"just":[117],"like":[118],"other":[119],"ordinary":[120],"values,":[121],"resulting":[122],"complex":[124],"structures,":[126],"especially":[127],"presence":[130],"mutable":[132,182],"state.":[133],"For":[134],"example,":[135],"futures":[139,205,282,316],"have":[141],"deadlocks,":[142,286],"impossible":[145],"fork-join":[147,327],"this":[150,195,214,221],"paper,":[151],"we":[152,227,244,274],"are":[153,197,216,236,240,283],"interested":[154],"theoretical":[157],"question":[158],"whether":[160],"may":[162,269,323],"extended":[164],"beyond":[165,326],"parallelism,":[167],"specifically":[169],"futures.":[171,303],"We":[172,199,218],"consider":[173,228],"language":[176,196,215],"Input/Output":[179],"(I/O),":[180],"state":[183,229,293],"(references)":[184],"show":[186,245,308],"broad":[189],"range":[190],"disentangled.":[198,217,272],"start":[200],"by":[201],"formalizing":[202],"proving":[207],"purely":[209],"then":[219],"generalize":[220],"result":[222],"three":[224],"directions.":[225],"First,":[226],"(effects)":[230],"prove":[232,275],"stateful":[234],"disentangled":[237,277],"if":[238],"they":[239],"race":[241,247],"free.":[242],"Second,":[243],"freedom":[248],"sufficient":[250],"but":[251],"necessary":[254],"condition":[255],"non-deterministic":[257,267],"e.g.":[259],"those":[260],"use":[262],"atomic":[263],"read-modify-operations":[264],"some":[266],"combinators,":[268],"also":[270],"Third,":[273],"task-parallel":[278],"free":[284],"arise":[288],"due":[289],"interactions":[291],"rich":[296],"dependencies":[297],"expressed":[301],"Taken":[304],"together,":[305],"these":[306],"results":[307],"generalizes":[311],"and,":[317],"thus,":[318],"benefits":[320],"go":[324],"well":[325]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}