论文标题
半光元的代数呈现
Algebraic Presentation of Semifree Monads
论文作者
论文摘要
Monads及其通过分配法律的组成在程序语义和功能编程中有许多应用。对于许多有趣的单调，分配法律不存在，这激发了对较弱概念的调查。在这一研究中，Petrişan和Sarkis最近引入了一种名为Semifree Monad的结构，以研究单核和弱分布定律的半密码。在本文中，我们证明，可以从M. Monad m上的半含量呈现Monad m s呈现。我们还表明，半自元是理想的单调，半空结构不是单子变压器，并且半空结构是单核类别的共同构造。
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.
