{"id":"https://openalex.org/W4386317707","doi":"https://doi.org/10.1145/3607848","title":"A General Fine-Grained Reduction Theory for Effect Handlers","display_name":"A General Fine-Grained Reduction Theory for Effect Handlers","publication_year":2023,"publication_date":"2023-08-30","ids":{"openalex":"https://openalex.org/W4386317707","doi":"https://doi.org/10.1145/3607848"},"language":"en","primary_location":{"id":"doi:10.1145/3607848","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3607848","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3607848","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/3607848","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047754900","display_name":"Filip Sieczkowski","orcid":"https://orcid.org/0000-0001-5011-3458"},"institutions":[{"id":"https://openalex.org/I32062511","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93","country_code":"GB","type":"education","lineage":["https://openalex.org/I32062511"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Filip Sieczkowski","raw_affiliation_strings":["Heriot-Watt University, UK"],"raw_orcid":"https://orcid.org/0000-0001-5011-3458","affiliations":[{"raw_affiliation_string":"Heriot-Watt University, UK","institution_ids":["https://openalex.org/I32062511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055013536","display_name":"Mateusz Pyzik","orcid":"https://orcid.org/0000-0002-9978-9536"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Mateusz Pyzik","raw_affiliation_strings":["University of Wroc\u0142aw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-9978-9536","affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083683038","display_name":"Dariusz Biernacki","orcid":"https://orcid.org/0000-0002-1477-4635"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Dariusz Biernacki","raw_affiliation_strings":["University of Wroc\u0142aw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-1477-4635","affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047754900"],"corresponding_institution_ids":["https://openalex.org/I32062511"],"apc_list":null,"apc_paid":null,"fwci":0.6627,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75330374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"7","issue":"ICFP","first_page":"511","last_page":"540"},"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.9998000264167786,"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.9998000264167786,"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/T10260","display_name":"Software Engineering Research","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9950000047683716,"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/soundness","display_name":"Soundness","score":0.8494480848312378},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6863550543785095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6682240962982178},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.658886194229126},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.6318487524986267},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.5970660448074341},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5461021065711975},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.49659615755081177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49490660429000854},{"id":"https://openalex.org/keywords/structuring","display_name":"Structuring","score":0.44435402750968933},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.42771488428115845},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4117385745048523},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3606123924255371},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2684987485408783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07987317442893982}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.8494480848312378},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6863550543785095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6682240962982178},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.658886194229126},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.6318487524986267},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5970660448074341},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5461021065711975},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.49659615755081177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49490660429000854},{"id":"https://openalex.org/C2775945657","wikidata":"https://www.wikidata.org/wiki/Q381442","display_name":"Structuring","level":2,"score":0.44435402750968933},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.42771488428115845},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4117385745048523},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3606123924255371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2684987485408783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07987317442893982},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3607848","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3607848","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3607848","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/3607848","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3607848","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3607848","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":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G6475273736","display_name":null,"funder_award_id":"2019/33/B/ST6/00289","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386317707.pdf","grobid_xml":"https://content.openalex.org/works/W4386317707.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W1491716119","https://openalex.org/W1511937404","https://openalex.org/W1917416321","https://openalex.org/W1971906578","https://openalex.org/W1974491122","https://openalex.org/W1983128619","https://openalex.org/W2007435074","https://openalex.org/W2007759294","https://openalex.org/W2018181305","https://openalex.org/W2019676725","https://openalex.org/W2036609822","https://openalex.org/W2086744387","https://openalex.org/W2097230120","https://openalex.org/W2102222848","https://openalex.org/W2102435409","https://openalex.org/W2105757380","https://openalex.org/W2127114597","https://openalex.org/W2129902163","https://openalex.org/W2149531431","https://openalex.org/W2159526276","https://openalex.org/W2160234152","https://openalex.org/W2160646753","https://openalex.org/W2168254994","https://openalex.org/W2208976468","https://openalex.org/W2293168108","https://openalex.org/W2561708922","https://openalex.org/W2758862544","https://openalex.org/W2777452194","https://openalex.org/W2899650865","https://openalex.org/W2900081643","https://openalex.org/W2912476809","https://openalex.org/W2950666866","https://openalex.org/W2955613535","https://openalex.org/W3012366501","https://openalex.org/W3015096137","https://openalex.org/W3101155261","https://openalex.org/W3103594074","https://openalex.org/W3105810746","https://openalex.org/W3107124382","https://openalex.org/W3107145433","https://openalex.org/W3206622374","https://openalex.org/W3206803084","https://openalex.org/W4230388769","https://openalex.org/W4249903311","https://openalex.org/W4282044797","https://openalex.org/W4288080273","https://openalex.org/W6912991103"],"related_works":["https://openalex.org/W1981466053","https://openalex.org/W2106305471","https://openalex.org/W2149285895","https://openalex.org/W2060914009","https://openalex.org/W2585545025","https://openalex.org/W2788308474","https://openalex.org/W4205743188","https://openalex.org/W2787105657","https://openalex.org/W2132918312","https://openalex.org/W4386317707"],"abstract_inverted_index":{"Effect":[0],"handlers":[1],"are":[2],"a":[3,33,39,57,72,97],"modern":[4],"and":[5,75,128,132,153,157],"increasingly":[6],"popular":[7],"approach":[8],"to":[9,25,65,86],"structuring":[10],"computational":[11],"effects":[12],"in":[13,168],"functional":[14],"programming":[15,102],"languages.":[16],"However,":[17],"while":[18],"their":[19],"traditional":[20],"operational":[21,69],"semantics":[22,70,89,143],"is":[23,29],"well-suited":[24],"implementation":[26],"tasks,":[27],"it":[28],"less":[30],"ideal":[31],"as":[32,96],"reduction":[34,41,51,59,79,124],"theory.":[35],"We":[36,61],"therefore":[37],"introduce":[38],"fine-grained":[40],"theory":[42,52,80,99],"for":[43,53,100,150],"deep":[44],"effect":[45,151],"handlers,":[46,91,152],"inspired":[47],"by":[48,144,172],"our":[49,123,142],"existing":[50,134],"shift0,":[54],"along":[55],"with":[56,84,110],"standard":[58],"strategy.":[60],"relate":[62],"this":[63,105],"strategy":[64],"the":[66,78,87,116,139,146,164,173],"traditional,":[67],"non-local":[68],"via":[71],"simulation":[73],"argument,":[74],"show":[76],"that":[77],"preserves":[81],"observational":[82],"equivalence":[83],"respect":[85],"classical":[88],"of":[90,122,141,163],"thus":[92],"allowing":[93],"its":[94,155],"use":[95],"rewriting":[98,106],"handler-equipped":[101],"languages":[103],"--":[104],"system":[107],"mostly":[108],"coincides":[109],"previously":[111],"studied":[112],"type-based":[113],"optimisations.":[114],"In":[115],"process,":[117],"we":[118,137,160],"establish":[119,161],"theoretical":[120],"properties":[121],"theory,":[125],"including":[126],"confluence":[127],"standardisation":[129],"theorems,":[130],"adapting":[131],"extending":[133],"techniques.":[135],"Finally,":[136],"demonstrate":[138],"utility":[140],"providing":[145],"first":[147],"normalisation-by-evaluation":[148],"algorithm":[149],"prove":[154],"soundness":[156],"completeness.":[158],"Additionally,":[159],"non-expressibility":[162],"lift":[165],"operator,":[166],"found":[167],"some":[169],"effect-handler":[170],"calculi,":[171],"other":[174],"constructs.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
