{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:43Z","timestamp":1780994683838,"version":"3.54.1"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T00:00:00Z","timestamp":1381795200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Programming languages with countable nondeterministic choice are\ncomputationally interesting since countable nondeterminism arises when modeling\nfairness for concurrent systems. Because countable choice introduces\nnon-continuous behaviour, it is well-known that developing semantic models for\nprogramming languages with countable nondeterminism is challenging. We present\na step-indexed logical relations model of a higher-order functional programming\nlanguage with countable nondeterminism and demonstrate how it can be used to\nreason about contextually defined may- and must-equivalence. In earlier\nstep-indexed models, the indices have been drawn from {\\omega}. Here the\nstep-indexed relations for must-equivalence are indexed over an ordinal greater\nthan {\\omega}.<\/jats:p>","DOI":"10.2168\/lmcs-9(4:4)2013","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:37:51Z","timestamp":1405417071000},"source":"Crossref","is-referenced-by-count":14,"title":["Step-Indexed Relational Reasoning for Countable Nondeterminism"],"prefix":"10.46298","volume":"Volume 9, Issue 4","author":[{"given":"Lars","family":"Birkedal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ale\u0161","family":"Bizjak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Schwinghammer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"736:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/940\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/940\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:30Z","timestamp":1681243170000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,15]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(4:4)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1310.2031","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1310.2031","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1701.05888","asserted-by":"subject"},{"id-type":"doi","id":"10.1007\/978-3-662-54434-1_34","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1701.05888","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,15]]},"article-number":"940"}}