{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:17Z","timestamp":1776316997451,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In the semantics of programming languages one can view programs as state transformers, or as predicate transformers. Recently the author has introduced state-and-effect triangles which capture this situation categorically, involving an adjunction between state- and predicate-transformers. The current paper exploits a classical result in category theory, part of Jon Beck's monadicity theorem, to systematically construct such a state-and-effect triangle from an adjunction. The power of this construction is illustrated in many examples, covering many monads occurring in program semantics, including (probabilistic) power domains.<\/jats:p>","DOI":"10.23638\/lmcs-13(2:6)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:30Z","timestamp":1743701550000},"source":"Crossref","is-referenced-by-count":2,"title":["A Recipe for State-and-Effect Triangles"],"prefix":"10.23638","volume":"Volume 13, Issue 2","author":[{"given":"Bart","family":"Jacobs","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,5,17]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1703.09034v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1703.09034v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:30Z","timestamp":1743701550000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,17]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(2:6)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1703.09034v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1703.09034","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1703.09034","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,17]]},"article-number":"3223"}}