{"id":"https://openalex.org/W4390604617","doi":"https://doi.org/10.1145/3632859","title":"Pipelines and Beyond: Graph Types for ADTs with Futures","display_name":"Pipelines and Beyond: Graph Types for ADTs with Futures","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390604617","doi":"https://doi.org/10.1145/3632859"},"language":"en","primary_location":{"id":"doi:10.1145/3632859","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632859","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632859","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/3632859","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041553234","display_name":"F. Rinaldi","orcid":"https://orcid.org/0009-0005-0007-0898"},"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":"Francis Rinaldi","raw_affiliation_strings":["Illinois Institute of Technology, Chicago, USA"],"raw_orcid":"https://orcid.org/0009-0005-0007-0898","affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology, Chicago, USA","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068707658","display_name":"june wunder","orcid":"https://orcid.org/0000-0002-3280-9731"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"june wunder","raw_affiliation_strings":["Boston University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-3280-9731","affiliations":[{"raw_affiliation_string":"Boston University, Boston, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086486652","display_name":"Arthur Azevedo de Amorim","orcid":"https://orcid.org/0000-0001-9916-6614"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arthur Azevedo de Amorim","raw_affiliation_strings":["Rochester Institute of Technology, Rochester, USA"],"raw_orcid":"https://orcid.org/0000-0001-9916-6614","affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology, Rochester, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"last","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"]}]}],"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.00331858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"POPL","first_page":"482","last_page":"511"},"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.9994999766349792,"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.9994999766349792,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7327257394790649},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6798439025878906},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6215935945510864},{"id":"https://openalex.org/keywords/futures-contract","display_name":"Futures contract","score":0.6003229022026062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5923753380775452},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5010726451873779},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4851318299770355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4073672592639923},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3224032521247864},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2975788116455078}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7327257394790649},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6798439025878906},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6215935945510864},{"id":"https://openalex.org/C106306483","wikidata":"https://www.wikidata.org/wiki/Q183984","display_name":"Futures contract","level":2,"score":0.6003229022026062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5923753380775452},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5010726451873779},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4851318299770355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4073672592639923},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3224032521247864},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2975788116455078},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3632859","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632859","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632859","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/3632859","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632859","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632859","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":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G1467667629","display_name":"SHF: Small: Automatic Qualitative and Quantitative Verification of CUDA Code","funder_award_id":"2007784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4704430651","display_name":"Collaborative Research: SHF: Medium: Responsive Parallelism for Interactive Applications: Theory and Practice","funder_award_id":"2107289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8945998200","display_name":"Collaborative Research: SaTC: CORE: Small: Mechanized Cryptographic Reasoning in Separation Logic","funder_award_id":"2314323","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/W4390604617.pdf","grobid_xml":"https://content.openalex.org/works/W4390604617.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1593182640","https://openalex.org/W1811793995","https://openalex.org/W1980948348","https://openalex.org/W1993460177","https://openalex.org/W2001673593","https://openalex.org/W2005192022","https://openalex.org/W2024929322","https://openalex.org/W2031144446","https://openalex.org/W2044872254","https://openalex.org/W2056714230","https://openalex.org/W2058162377","https://openalex.org/W2087875803","https://openalex.org/W2112474400","https://openalex.org/W2122937771","https://openalex.org/W2144249474","https://openalex.org/W2171628704","https://openalex.org/W2293624369","https://openalex.org/W2518300910","https://openalex.org/W2912293148","https://openalex.org/W2998338832","https://openalex.org/W3019259517","https://openalex.org/W3034717274","https://openalex.org/W3122002490","https://openalex.org/W3210291382","https://openalex.org/W4205117926","https://openalex.org/W4205979273","https://openalex.org/W4238387639","https://openalex.org/W4281922598"],"related_works":["https://openalex.org/W1511249877","https://openalex.org/W2466303427","https://openalex.org/W1578828174","https://openalex.org/W2000943029","https://openalex.org/W2950376466","https://openalex.org/W4302559785","https://openalex.org/W4226437312","https://openalex.org/W1969483203","https://openalex.org/W2949331520","https://openalex.org/W2140496290"],"abstract_inverted_index":{"Parallel":[0],"programs":[1],"are":[2,37,171],"frequently":[3],"modeled":[4],"as":[5],"dependency":[6],"or":[7,18,129],"cost":[8],"graphs,":[9],"which":[10,47],"can":[11,55,286],"be":[12,56,108,125,130,287],"used":[13,131],"to":[14,20,51,59,118,132,156,221,268],"detect":[15],"various":[16],"bugs,":[17],"simply":[19],"visualize":[21],"the":[22,26,69,78,119,146,165,222,230,233,248,259],"parallel":[23,237,296],"structure":[24,211,215],"of":[25,71,88,98,104,148,154,168,173,175,195,232],"code.":[27],"However,":[28],"such":[29,143],"graphs":[30,73],"reflect":[31],"just":[32],"one":[33],"particular":[34],"execution":[35],"and":[36,66,94,197,244,276],"typically":[38],"constructed":[39],"in":[40,85,127,224,235,257],"a":[41,60,63,105,112,140,185,208,213,225,236,279],"post-hoc":[42],"manner.":[43],"Graph":[44],"types":[45,272],",":[46,90,212],"were":[48],"introduced":[49],"recently":[50],"mitigate":[52],"this":[53,116,181,252],"problem,":[54],"assigned":[57],"statically":[58,109],"program":[61],"by":[62,204],"type":[64,178,187,260],"system":[65,188,234],"compactly":[67],"represent":[68],"family":[70],"all":[72],"that":[74,121,151,189,216,264,283],"could":[75,123],"result":[76],"from":[77,289],"program.":[79],"Unfortunately,":[80],"prior":[81,176],"work":[82],"is":[83,138,250,253,266],"restricted":[84],"its":[86],"treatment":[87],"futures":[89,122,196,223],"an":[91],"increasingly":[92],"common":[93],"especially":[95],"dynamic":[96],"form":[97,145],"parallelism.":[99],"In":[100,180],"short,":[101],"each":[102],"instance":[103],"future":[106],"must":[107],"paired":[110],"with":[111,207,241,273],"vertex":[113,210,219,242,274],"name.":[114],"Previously,":[115],"led":[117],"restriction":[120],"not":[124,139,159],"placed":[126],"collections":[128],"construct":[133],"data":[134,199,226],"structures.":[135],"Doing":[136],"so":[137,203],"niche":[141],"exercise:":[142],"structures":[144,243],"basis":[147],"numerous":[149],"algorithms":[150],"use":[152],"forms":[153],"pipelining":[155],"achieve":[157],"performance":[158],"attainable":[160],"without":[161],"futures.":[162],"All":[163],"but":[164],"most":[166],"limited":[167],"these":[169,284],"examples":[170],"out":[172],"reach":[174],"graph":[177,186],"systems.":[179],"paper,":[182],"we":[183],"propose":[184],"allows":[190],"for":[191,255,293],"almost":[192],"arbitrary":[193,270],"combinations":[194],"recursive":[198,271],"types.":[200],"We":[201,228,262],"do":[202],"indexing":[205],"datatypes":[206],"type-level":[209],"codata":[214],"supplies":[217],"unique":[218],"names":[220],"structure.":[227],"prove":[229,263],"soundness":[231],"core":[238],"calculus":[239,249],"annotated":[240],"associated":[245],"operations.":[246],"Although":[247],"annotated,":[251],"merely":[254],"convenience":[256],"defining":[258],"system.":[261],"it":[265],"possible":[267],"annotate":[269],"structures,":[275],"show":[277],"using":[278],"prototype":[280],"inference":[281],"engine":[282],"annotations":[285],"inferred":[288],"OCaml-like":[290],"source":[291],"code":[292],"several":[294],"complex":[295],"algorithms.":[297]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}