{"id":"https://openalex.org/W4214606539","doi":"https://doi.org/10.1017/s0956796822000016","title":"Back to futures","display_name":"Back to futures","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4214606539","doi":"https://doi.org/10.1017/s0956796822000016"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796822000016","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796822000016","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9FA8FD46A69EDCD889CEE58756418CC6/S0956796822000016a.pdf/div-class-title-back-to-futures-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9FA8FD46A69EDCD889CEE58756418CC6/S0956796822000016a.pdf/div-class-title-back-to-futures-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006152303","display_name":"Klaas Pruiksma","orcid":"https://orcid.org/0000-0002-6032-087X"},"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":true,"raw_author_name":"KLAAS PRUIKSMA","raw_affiliation_strings":["Computer Science Department Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-6032-087X","affiliations":[{"raw_affiliation_string":"Computer Science Department Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021476649","display_name":"Frank Pfenning","orcid":"https://orcid.org/0000-0002-8279-5817"},"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":"FRANK PFENNING","raw_affiliation_strings":["Computer Science Department Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006152303"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.8325,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76843309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"32","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8991835713386536},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8414821028709412},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7749762535095215},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.49829912185668945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4867537021636963},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.47332558035850525},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.42330506443977356},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.41928011178970337},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.41239842772483826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8991835713386536},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8414821028709412},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7749762535095215},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.49829912185668945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4867537021636963},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.47332558035850525},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.42330506443977356},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.41928011178970337},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.41239842772483826},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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.1017/s0956796822000016","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796822000016","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9FA8FD46A69EDCD889CEE58756418CC6/S0956796822000016a.pdf/div-class-title-back-to-futures-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796822000016","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796822000016","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9FA8FD46A69EDCD889CEE58756418CC6/S0956796822000016a.pdf/div-class-title-back-to-futures-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7824405778","display_name":"SHF:Small: Enriching Session Types for Practical Concurrent Programming","funder_award_id":"1718267","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/W4214606539.pdf","grobid_xml":"https://content.openalex.org/works/W4214606539.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W53839316","https://openalex.org/W1502726770","https://openalex.org/W1537467263","https://openalex.org/W1784055113","https://openalex.org/W1941373452","https://openalex.org/W1983587324","https://openalex.org/W1985787017","https://openalex.org/W1995689755","https://openalex.org/W1999161312","https://openalex.org/W2004839050","https://openalex.org/W2023132547","https://openalex.org/W2076859913","https://openalex.org/W2086727636","https://openalex.org/W2088962847","https://openalex.org/W2095778029","https://openalex.org/W2124126159","https://openalex.org/W2159869514","https://openalex.org/W2267766518","https://openalex.org/W2293895310","https://openalex.org/W2515656721","https://openalex.org/W2799001871","https://openalex.org/W2949311029","https://openalex.org/W3081681916","https://openalex.org/W3099937577","https://openalex.org/W3105466317","https://openalex.org/W4233387250","https://openalex.org/W4238292764"],"related_works":["https://openalex.org/W2271904544","https://openalex.org/W2962876128","https://openalex.org/W1667758182","https://openalex.org/W4214787291","https://openalex.org/W4387686364","https://openalex.org/W4385970027","https://openalex.org/W4382891113","https://openalex.org/W1496993747","https://openalex.org/W4293452374","https://openalex.org/W2247835999"],"abstract_inverted_index":{"Abstract":[0],"Common":[1],"approaches":[2],"to":[3,22,53,62,91,101,118,142,199],"concurrent":[4,81],"programming":[5],"begin":[6],"with":[7,79,173],"languages":[8],"whose":[9],"semantics":[10,57],"are":[11,140],"naturally":[12],"sequential":[13,103],"and":[14,48,105,123,160,184],"add":[15,94],"new":[16],"constructs":[17,69],"that":[18,58,98,168,185],"provide":[19,39],"limited":[20],"access":[21],"concurrency,":[23],"as":[24],"exemplified":[25],"by":[26,158],"futures":[27,149],".":[28],"This":[29],"approach":[30,166],"has":[31],"been":[32,153],"quite":[33],"successful,":[34],"but":[35],"often":[36],"does":[37],"not":[38],"a":[40,55,60,71,75,80,85,144,181],"satisfactory":[41],"theoretical":[42],"backing":[43],"for":[44],"the":[45,127,176,196],"concurrency":[46,125,178,194],"constructs,":[47],"it":[49],"can":[50,170,187],"be":[51],"difficult":[52],"give":[54,143],"good":[56],"allows":[59],"programmer":[61],"use":[63],"more":[64],"than":[65],"one":[66],"of":[67,88,108,147,164,175,190,193],"these":[68,191],"at":[70],"time.":[72],"We":[73],"take":[74],"different":[76,201],"approach,":[77],"starting":[78],"language":[82,112,133],"based":[83,135],"on":[84,136],"Curry\u2013Howard":[86],"interpretation":[87],"adjoint":[89,137],"logic,":[90,138],"which":[92,151],"we":[93,139,169,186],"three":[95],"atomic":[96],"primitives":[97,179],"allow":[99],"us":[100,117],"encode":[102,119],"composition":[104],"various":[106],"forms":[107,192],"synchronization.":[109],"The":[110,162],"resulting":[111],"is":[113,134],"highly":[114],"expressive,":[115],"allowing":[116],"futures,":[120],"fork/join":[121],"parallelism,":[122],"monadic":[124],"in":[126,155,180,195],"same":[128,197],"framework.":[129],"Notably,":[130],"since":[131],"our":[132],"able":[141],"formal":[145],"account":[146],"linear":[148,182],",":[150],"have":[152],"used":[154],"complexity":[156],"analysis":[157],"Blelloch":[159],"Reid-Miller.":[161],"uniformity":[163],"this":[165],"means":[167],"similarly":[171],"work":[172],"many":[174],"other":[177],"fashion,":[183],"mix":[188],"several":[189],"program":[198],"serve":[200],"purposes.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2022-03-02T00:00:00"}