{"id":"https://openalex.org/W7168372520","doi":"https://doi.org/10.4230/lipics.fscd.2026.4","title":"Strong Normalisation for Asynchronous Effects","display_name":"Strong Normalisation for Asynchronous Effects","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168372520","doi":"https://doi.org/10.4230/lipics.fscd.2026.4"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26354","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.4","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.4/LIPIcs.FSCD.2026.4.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.4/LIPIcs.FSCD.2026.4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140910693","display_name":"Danel Ahman","orcid":"https://orcid.org/0000-0001-6595-2756"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Ahman, Danel","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Estonia"],"raw_orcid":"https://orcid.org/0000-0001-6595-2756","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5140777828","display_name":"Ilja Sobolev","orcid":"https://orcid.org/0009-0000-0939-6388"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Sobolev, Ilja","raw_affiliation_strings":["Institute of Mathematics and Statistics, University of Tartu, Estonia"],"raw_orcid":"https://orcid.org/0009-0000-0939-6388","affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Statistics, University of Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.86286051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9217000007629395,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9217000007629395,"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/T10126","display_name":"Logic, programming, and type systems","score":0.03799999877810478,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.010200000368058681,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.8284000158309937},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6301000118255615},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6159999966621399},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6065999865531921},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5271000266075134},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5259000062942505},{"id":"https://openalex.org/keywords/interrupt","display_name":"Interrupt","score":0.45019999146461487},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.44029998779296875},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4316999912261963}],"concepts":[{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.8284000158309937},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6301000118255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6281999945640564},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6159999966621399},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6065999865531921},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5271000266075134},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5259000062942505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5148000121116638},{"id":"https://openalex.org/C41661131","wikidata":"https://www.wikidata.org/wiki/Q220764","display_name":"Interrupt","level":3,"score":0.45019999146461487},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36959999799728394},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.36079999804496765},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.328000009059906},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29910001158714294},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C2989065042","wikidata":"https://www.wikidata.org/wiki/Q7378971","display_name":"Algebraic properties","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26354","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.4","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.4/LIPIcs.FSCD.2026.4.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fscd.2026.4","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2026.4","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26354","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.4","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.4/LIPIcs.FSCD.2026.4.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3915529232","display_name":"Explainable Verification","funder_award_id":"PRG2764","funder_id":"https://openalex.org/F4320321090","funder_display_name":"Eesti Teadusagentuur"}],"funders":[{"id":"https://openalex.org/F4320321090","display_name":"Eesti Teadusagentuur","ror":"https://ror.org/00jjeja18"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168372520.pdf","grobid_xml":"https://content.openalex.org/works/W7168372520.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Asynchronous":[0],"effects":[1,13],"of":[2,11,21,89,128,138,153,163],"Ahman":[3],"and":[4,35,78,113,155],"Pretnar":[5],"complement":[6],"the":[7,19,42,47,62,86,103,125,129],"conventional":[8],"synchronous":[9],"treatment":[10],"algebraic":[12,22,60],"with":[14,41],"asynchrony":[15,58],"based":[16],"on":[17],"decoupling":[18],"execution":[20],"operation":[23],"calls":[24],"into":[25,36],"signalling":[26],"that":[27,94,124],"an":[28,151],"operation\u2019s":[29,43],"implementation":[30],"needs":[31],"to":[32,45],"be":[33],"executed,":[34],"interrupting":[37],"a":[38,135],"running":[39],"computation":[40,48],"result,":[44],"which":[46],"can":[49],"react":[50],"by":[51],"installing":[52],"matching":[53],"interrupt":[54],"handlers.":[55],"Beyond":[56],"providing":[57],"for":[59,159],"effects,":[61],"resulting":[63],"core":[64],"calculus":[65,105,130],"also":[66,122,170],"naturally":[67],"models":[68],"examples":[69],"such":[70],"as":[71,150],"pre-emptive":[72],"multi-threading,":[73],"(cancellable)":[74],"remote":[75],"function":[76],"calls,":[77],"multi-party":[79],"applications.":[80],"In":[81],"this":[82,90],"paper,":[83],"we":[84,121],"study":[85],"normalisation":[87,145,162],"properties":[88],"calculus.":[91],"We":[92],"prove":[93,123],"if":[95],"one":[96],"removes":[97],"general":[98],"recursion":[99],"from":[100],"it,":[101],"then":[102],"remaining":[104],"is":[106,142],"strongly":[107,132],"normalising,":[108],"including":[109],"both":[110],"its":[111],"sequential":[112,126],"parallel":[114],"parts.":[115],"To":[116],"cover":[117],"more":[118],"interesting":[119],"programs,":[120],"part":[127],"remains":[131],"normalising":[133],"when":[134],"controlled":[136],"amount":[137],"interrupt-driven":[139],"recursive":[140],"behaviour":[141],"reintroduced.":[143],"Our":[144],"proofs":[146],"are":[147,169],"structured":[148],"compositionally":[149],"extension":[152],"Lindley":[154],"Stark\u2019s":[156],"\u22a4\u22a4-lifting-based":[157],"approach":[158],"proving":[160],"strong":[161],"effectful":[164],"languages.":[165],"All":[166],"our":[167],"results":[168],"formalised":[171],"in":[172],"Agda.":[173]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-16T00:00:00"}