{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:47:51Z","timestamp":1755694071570,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"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>We extend the formalisation of confluence results in Kleene algebras to a\nformalisation of coherent confluence proofs. For this, we introduce the\nstructure of higher globular Kleene algebra, a higher-dimensional\ngeneralisation of modal and concurrent Kleene algebra. We calculate a coherent\nChurch-Rosser theorem and a coherent Newman's lemma in higher Kleene algebras\nby equational reasoning. We instantiate these results in the context of higher\nrewriting systems modelled by polygraphs.<\/jats:p>","DOI":"10.46298\/lmcs-18(4:9)2022","type":"journal-article","created":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T09:14:02Z","timestamp":1672132442000},"source":"Crossref","is-referenced-by-count":3,"title":["Algebraic coherent confluence and higher globular Kleene algebras"],"prefix":"10.46298","volume":"Volume 18, Issue 4","author":[{"given":"Cameron","family":"Calk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Goubault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Malbos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,11,28]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/10536\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/10536\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:18:07Z","timestamp":1687292287000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(4:9)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2006.16129v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2006.16129v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2006.16129v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2006.16129","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2006.16129","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"article-number":"6743"}}