{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:11:49Z","timestamp":1765667509605,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We present a comprehensive study of the behavioral theory of an untyped $\\lambda$-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to characterize with coinductively defined relations, called bisimilarities. We consider different styles of bisimilarities (namely applicative, normal-form, and environmental) within a unifying framework, and we give several examples to illustrate their respective strengths and weaknesses. We also discuss how to extend this work to other delimited-control operators.<\/jats:p>","DOI":"10.23638\/lmcs-15(2:18)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:19Z","timestamp":1743701839000},"source":"Crossref","is-referenced-by-count":1,"title":["Bisimulations for Delimited-Control Operators"],"prefix":"10.23638","volume":"Volume 15, Issue 2","author":[{"given":"Dariusz","family":"Biernacki","sequence":"first","affiliation":[]},{"given":"Sergue\u00ef","family":"Lenglet","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Polesiuk","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,5,24]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1804.08373v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1804.08373v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:19Z","timestamp":1743701839000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,24]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(2:18)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1804.08373v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1804.08373v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1804.08373v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1804.08373","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1804.08373","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,5,24]]},"article-number":"4458"}}