Algebraic Presentation of Semifree Monads

TL;DR

This paper provides an algebraic framework for semifree monads, showing they can be uniformly derived from existing monad presentations and exploring their categorical properties.

Contribution

It proves that semifree monads can be algebraically presented from a given monad and establishes their properties as ideal monads, a comonad, and not a monad transformer.

Findings

Algebraic presentation of semifree monads derived from original monads.

Semifree monads are shown to be ideal monads.

Semifree construction is a comonad, not a monad transformer.

Abstract

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\c{s}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\c{s}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.