{"id":"https://openalex.org/W4315606535","doi":"https://doi.org/10.1145/3571195","title":"Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice","display_name":"Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice","publication_year":2023,"publication_date":"2023-01-09","ids":{"openalex":"https://openalex.org/W4315606535","doi":"https://doi.org/10.1145/3571195"},"language":"en","primary_location":{"id":"doi:10.1145/3571195","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571195","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571195","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/3571195","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073092626","display_name":"Alejandro Aguirre","orcid":"https://orcid.org/0000-0001-6746-2734"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Alejandro Aguirre","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6746-2734","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1320-0098","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1211,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89352118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"7","issue":"POPL","first_page":"33","last_page":"60"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8730810880661011},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7027605772018433},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.6986413598060608},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5634028315544128},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5257559418678284},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.5047270059585571},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.4628436267375946},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.4400441348552704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43621671199798584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4049021899700165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3353610634803772}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8730810880661011},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7027605772018433},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.6986413598060608},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5634028315544128},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5257559418678284},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.5047270059585571},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.4628436267375946},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.4400441348552704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43621671199798584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4049021899700165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3353610634803772},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3571195","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571195","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571195","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.atira.dk:publications/ec8e5f59-0d1a-4feb-a6c6-b44352300da7","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/ec8e5f59-0d1a-4feb-a6c6-b44352300da7","pdf_url":"https://pure.au.dk/ws/files/420153131/3571195.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aguirre, A & Birkedal, L 2023, 'Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice', Proceedings of the ACM on Programming Languages , vol. 7, 2, pp. 33-60. https://doi.org/10.1145/3571195","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3571195","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571195","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571195","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/G6851704783","display_name":null,"funder_award_id":"25804","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4315606535.pdf","grobid_xml":"https://content.openalex.org/works/W4315606535.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W174696255","https://openalex.org/W1483535695","https://openalex.org/W1508098446","https://openalex.org/W1532374486","https://openalex.org/W1539402181","https://openalex.org/W1862398452","https://openalex.org/W1970904244","https://openalex.org/W1991984504","https://openalex.org/W2009311190","https://openalex.org/W2014552079","https://openalex.org/W2024355065","https://openalex.org/W2033104047","https://openalex.org/W2046213250","https://openalex.org/W2062024564","https://openalex.org/W2082241908","https://openalex.org/W2087403174","https://openalex.org/W2117091339","https://openalex.org/W2149837936","https://openalex.org/W2155748644","https://openalex.org/W2206718322","https://openalex.org/W2222812367","https://openalex.org/W2280241954","https://openalex.org/W2395654200","https://openalex.org/W2512575065","https://openalex.org/W2595263283","https://openalex.org/W2597297629","https://openalex.org/W2604738573","https://openalex.org/W2761554012","https://openalex.org/W2770908033","https://openalex.org/W2785464537","https://openalex.org/W2886147193","https://openalex.org/W2900404128","https://openalex.org/W2912723978","https://openalex.org/W2949151551","https://openalex.org/W2963852542","https://openalex.org/W2966086059","https://openalex.org/W3024760727","https://openalex.org/W3081526170","https://openalex.org/W3099770025","https://openalex.org/W3122767180","https://openalex.org/W3124655276","https://openalex.org/W3176572529","https://openalex.org/W3176870867","https://openalex.org/W4205512329","https://openalex.org/W4251232459","https://openalex.org/W4254183471","https://openalex.org/W4409970543"],"related_works":["https://openalex.org/W2152206644","https://openalex.org/W2153717963","https://openalex.org/W3213784925","https://openalex.org/W4248627364","https://openalex.org/W2037507558","https://openalex.org/W2913266263","https://openalex.org/W2212095449","https://openalex.org/W1508777689","https://openalex.org/W1548292705","https://openalex.org/W4315606535"],"abstract_inverted_index":{"Developing":[0],"denotational":[1],"models":[2],"for":[3,93,145],"higher-order":[4,33],"languages":[5],"that":[6,70,135],"combine":[7],"probabilistic":[8,41,48,146],"and":[9,43,52,57,68,74,109,115,133,147],"nondeterministic":[10,148],"choice":[11,42],"is":[12],"known":[13],"to":[14,78],"be":[15],"very":[16],"challenging.":[17],"In":[18],"this":[19],"paper,":[20],"we":[21,63,85,95,124],"propose":[22],"an":[23],"alternative":[24],"approach":[25],"based":[26],"on":[27],"operational":[28],"techniques.":[29],"We":[30,46,101],"study":[31],"a":[32],"language":[34],"combining":[35],"parametric":[36],"polymorphism,":[37],"recursive":[38],"types,":[39],"discrete":[40],"countable":[44,99],"nondeterminism.":[45],"define":[47,64],"generalizations":[49],"of":[50,60,107,118,141],"may-":[51,108],"must-termination":[53,110],"as":[54],"the":[55,79,89,98,105,113,126,138,142],"optimal":[56],"pessimal":[58],"probabilities":[59,106,117],"termination.":[61],"Then":[62],"step-indexed":[65],"logical":[66],"relations":[67],"show":[69,103,134],"they":[71],"are":[72],"sound":[73],"complete":[75],"with":[76,112],"respect":[77],"induced":[80,129],"contextual":[81,131],"preorders.":[82],"For":[83],"may-equivalence":[84],"use":[86],"step-indexing":[87],"over":[88,97],"natural":[90],"numbers":[91],"whereas":[92],"must-equivalence":[94],"index":[96],"ordinals.":[100],"then":[102],"than":[104],"coincide":[111],"maximal":[114],"minimal":[116],"termination":[119],"under":[120],"all":[121],"schedulers.":[122],"Finally":[123],"derive":[125],"equational":[127],"theory":[128],"by":[130],"equivalence":[132],"it":[136],"validates":[137],"distributive":[139],"combination":[140],"algebraic":[143],"theories":[144],"choice.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}