{"id":"https://openalex.org/W2963481060","doi":"https://doi.org/10.1145/3290337","title":"Better late than never: a fully-abstract semantics for classical processes","display_name":"Better late than never: a fully-abstract semantics for classical processes","publication_year":2019,"publication_date":"2019-01-02","ids":{"openalex":"https://openalex.org/W2963481060","doi":"https://doi.org/10.1145/3290337","mag":"2963481060"},"language":"en","primary_location":{"id":"doi:10.1145/3290337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290337","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/3290337","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079083322","display_name":"Wen Kokke","orcid":"https://orcid.org/0000-0002-1662-0381"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Wen Kokke","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000566520","display_name":"Fabrizio Montesi","orcid":"https://orcid.org/0000-0003-4666-901X"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Fabrizio Montesi","raw_affiliation_strings":["University of Southern Denmark, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022827521","display_name":"Marco Peressotti","orcid":"https://orcid.org/0000-0002-0243-0480"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Marco Peressotti","raw_affiliation_strings":["University of Southern Denmark, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079083322"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":3.6127,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.94431971,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"3","issue":"POPL","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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":0.9998999834060669,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973000288009644,"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.9940000176429749,"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/semantics","display_name":"Semantics (computer science)","score":0.6021024584770203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4076431095600128},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.3441353440284729},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.2929055094718933},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27817368507385254}],"concepts":[{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6021024584770203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4076431095600128},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.3441353440284729},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.2929055094718933},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27817368507385254}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3290337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290337","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"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/61f19098-e42f-4d0c-bce3-ec5d9e228639","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/61f19098-e42f-4d0c-bce3-ec5d9e228639","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kokke, W, Montesi, F & Peressotti, M 2019, 'Better Late Than Never: A Fully-abstract Semantics for Classical Processes', Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 24. https://doi.org/10.1145/3290337","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:sdu.dk:openaire/e0ba026a-e323-44be-8cf7-dda25f4c0540","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/e0ba026a-e323-44be-8cf7-dda25f4c0540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kokke, W, Montesi, F & Peressotti, M 2019, 'Better Late Than Never : A Fully-abstract Semantics for Classical Processes', Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 24, pp. 24:1-24:29. https://doi.org/10.1145/3290337","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/61f19098-e42f-4d0c-bce3-ec5d9e228639","is_oa":true,"landing_page_url":"http://doi.acm.org/10.1145/3290337","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kokke, W, Montesi, F & Peressotti, M 2019, 'Better Late Than Never: A Fully-abstract Semantics for Classical Processes', Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 24. https://doi.org/10.1145/3290337","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3290337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290337","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":[],"awards":[{"id":"https://openalex.org/G1934935867","display_name":null,"funder_award_id":"Engineering and Physical Sciences R","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3276400090","display_name":"EPSRC Centre for Doctoral Training in Pervasive Parallelism","funder_award_id":"EP/L01503X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7918631928","display_name":null,"funder_award_id":"EP/K034413/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963481060.pdf","grobid_xml":"https://content.openalex.org/works/W2963481060.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W258022877","https://openalex.org/W1503973138","https://openalex.org/W1532742882","https://openalex.org/W1537467263","https://openalex.org/W1607623316","https://openalex.org/W1784055113","https://openalex.org/W1966949854","https://openalex.org/W1971043428","https://openalex.org/W1986229147","https://openalex.org/W1993205599","https://openalex.org/W2001299902","https://openalex.org/W2004063149","https://openalex.org/W2008838944","https://openalex.org/W2010649834","https://openalex.org/W2023149698","https://openalex.org/W2042360145","https://openalex.org/W2054150540","https://openalex.org/W2080718905","https://openalex.org/W2083853821","https://openalex.org/W2118229393","https://openalex.org/W2121722880","https://openalex.org/W2138552902","https://openalex.org/W2138769606","https://openalex.org/W2156429182","https://openalex.org/W2325347394","https://openalex.org/W2483412402","https://openalex.org/W2517371102","https://openalex.org/W2553788418","https://openalex.org/W2594993942","https://openalex.org/W2596262883","https://openalex.org/W2761131108","https://openalex.org/W2797550608","https://openalex.org/W2911865844","https://openalex.org/W3005030212"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2053618139"],"abstract_inverted_index":{"We":[0,148,187],"present":[1],"Hypersequent":[2],"Classical":[3],"Processes":[4],"(HCP),":[5],"a":[6,107,128,150,197],"revised":[7],"interpretation":[8],"of":[9,56,70,80,124,131,169,184],"the":[10,19,45,51,60,74,99,117,122,132,146,181],"\u201cProofs":[11],"as":[12],"Processes\u201d":[13],"correspondence":[14],"between":[15,47],"linear":[16,48,65],"logic":[17,49,66],"and":[18,26,31,35,38,50,53,88,137,159,190,195,204],"\u03c0-calculus":[20],"initially":[21],"proposed":[22],"by":[23,29,62,73,76,86],"Abramsky":[24],"[1994],":[25,33],"later":[27],"developed":[28],"Bellin":[30],"Scott":[32],"Caires":[34],"Pfenning":[36],"[2010],":[37],"Wadler":[39],"[2014],":[40],"among":[41],"others.":[42],"HCP":[43,164,179],"mends":[44],"discrepancies":[46],"syntax":[52],"observable":[54],"semantics":[55,112,152],"parallel":[57,91],"composition":[58],"in":[59,82,145,163],"\u03c0-calculus,":[61],"conservatively":[63],"extending":[64],"to":[67,90,95,105,141,166,177],"hyperenvironments":[68,83],"(collections":[69],"environments,":[71],"inspired":[72],"hypersequents":[75],"Avron":[77],"[1991]).":[78],"Separation":[79],"environments":[81],"is":[84],"internalised":[85],"\u2297":[87],"corresponds":[89,165],"process":[92],"behaviour.":[93],"Thanks":[94],"this":[96],"property,":[97],"for":[98,153,193],"first":[100],"time":[101],"we":[102,126],"are":[103],"able":[104],"extract":[106],"labelled":[108],"transition":[109],"system":[110],"(lts)":[111],"from":[113],"proof":[114],"rewritings.":[115],"Leveraging":[116],"information":[118],"on":[119,156],"parallelism":[120],"at":[121],"level":[123],"types,":[125],"obtain":[127,196],"logical":[129],"reconstruction":[130],"delayed":[133],"actions":[134],"that":[135,161],"Merro":[136],"Sangiorgi":[138],"[2004]":[139],"formulated":[140],"model":[142],"non-blocking":[143],"I/O":[144],"\u03c0-calculus.":[147],"define":[149],"denotational":[151,202],"processes":[154],"based":[155],"Brzozowski":[157],"derivatives,":[158],"uncover":[160],"non-interference":[162],"Fubini\u2019s":[167],"theorem":[168],"double":[170],"antiderivation.":[171],"Having":[172],"an":[173],"lts":[174],"allows":[175],"us":[176],"validate":[178],"using":[180],"standard":[182],"toolbox":[183],"behavioural":[185],"theory.":[186],"instantiate":[188],"bisimilarity":[189],"barbed":[191,205],"congruence":[192,206],"HCP,":[194],"full":[198],"abstraction":[199],"result:":[200],"bisimilarity,":[201],"equivalence,":[203],"coincide.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}