Summary
Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to exist, and this has motivated investigations into weaker notions. In this line of research, Petrişan and Sarkis recently introduced a construction called the semifree monad in order to study semialgebras for a monad and weak distributive laws. In this paper, we prove that an algebraic presentation of the semifree monad M^s on a monad M can be obtained uniformly from an algebraic presentation of M. This result was conjectured by Petrişan and Sarkis. We also show that semifree monads are ideal monads, that the semifree construction is not a monad transformer, and that the semifree construction is a comonad on the category of monads.
Bibtex
@inproceedings{monads:semifree:2022,
author = {Rosset, Alo{\"{\i}}s and Hansen, Helle Hvid and Endrullis, J{\"{o}}rg},
editor = {Hansen, Helle Hvid and Zanasi, Fabio},
title = {Algebraic Presentation of Semifree Monads},
booktitle = {Coalgebraic Methods in Computer Science - 16th {IFIP} {WG} 1.3 International
Workshop, {CMCS} 2022, Colocated with {ETAPS} 2022, Munich, Germany,
April 2-3, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13225},
pages = {110--132},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-10736-8\_6},
doi = {10.1007/978-3-031-10736-8\_6},
biburl = {https://dblp.org/rec/conf/cmcs/RossetHE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org},
keywords = {coalgebra},
type = {workshop}
}