{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:31Z","timestamp":1773479011264,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T00:00:00Z","timestamp":1747353600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T00:00:00Z","timestamp":1747353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T00:00:00Z","timestamp":1747353600000},"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,7]]},"abstract":"<jats:p>In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework, where the choice is parameterized by an algebraic side effect: the model can support regular tests, probabilistic and non-deterministic branching, as well as quantum branching, i.e. superposition.   The graphical language comes equipped with a denotational semantics based on linear applications, and an equational theory. We prove the language to be universal, and the equational theory to be complete with respect to this semantics.<\/jats:p>","DOI":"10.46298\/lmcs-21(2:13)2025","type":"journal-article","created":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T16:05:07Z","timestamp":1747411507000},"source":"Crossref","is-referenced-by-count":2,"title":["The Many-Worlds Calculus"],"prefix":"10.46298","volume":"Volume 21, Issue 2","author":[{"given":"Kostia","family":"Chardonnet","sequence":"first","affiliation":[]},{"given":"Marc","family":"de Visme","sequence":"additional","affiliation":[]},{"given":"Beno\u00eet","family":"Valiron","sequence":"additional","affiliation":[]},{"given":"Renaud","family":"Vilmart","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,5,16]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2206.10234v6","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2206.10234v6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T11:43:07Z","timestamp":1751024587000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/12630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,16]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(2:13)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2206.10234v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2206.10234v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2206.10234","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2206.10234","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,16]]},"article-number":"12630"}}