{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:49Z","timestamp":1753889809096,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T00:00:00Z","timestamp":1438905600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["9307"],"award-info":[{"award-number":["9307"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["5755"],"award-info":[{"award-number":["5755"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Distributive laws of a monad T over a functor F are categorical tools for\nspecifying algebra-coalgebra interaction. They proved to be important for\nsolving systems of corecursive equations, for the specification of well-behaved\nstructural operational semantics and, more recently, also for enhancements of\nthe bisimulation proof method. If T is a free monad, then such distributive\nlaws correspond to simple natural transformations. However, when T is not free\nit can be rather difficult to prove the defining axioms of a distributive law.\nIn this paper we describe how to obtain a distributive law for a monad with an\nequational presentation from a distributive law for the underlying free monad.\nWe apply this result to show the equivalence between two different\nrepresentations of context-free languages.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:2)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":4,"title":["Presenting Distributive Laws"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-3618","authenticated-orcid":false,"given":"Marcello M.","family":"Bonsangue","sequence":"first","affiliation":[]},{"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8685-5207","authenticated-orcid":false,"given":"Alexander","family":"Kurz","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,8,7]]},"reference":[{"key":"987:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1578\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1578\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:05Z","timestamp":1681243625000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,7]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:2)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1503.02447","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1503.02447","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,8,7]]},"article-number":"1578"}}