Related papers: Monads and distributive laws for Rota-Baxter and d…
In a previous study, the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC) is shown to allow extensions of differential and Rota-Baxter operators on the one hand, and to give rise to categorical explanations using…
Generalizing the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC), a class of constraints involving a pair of operators was considered in \cite{ZGK2}. For a given constraint, the existences of extensions of…
Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural…
We give a framework for combining $n$ monads on the same category via distributive laws satisfying Yang-Baxter equations, extending the classical result of Barr and Wells which combines two monads via one distributive law. We show that this…
The algebraic formulation of the derivation and integration related by the First Fundamental Theorem of Calculus (FFTC) gives rise to the notion of differential Rota-Baxter algebra. The notion has a remarkable list of categorical…
We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…
Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone. The literature contains some general principles for…
Monads play an important role in both the syntax and semantics of modern functional programming languages. The problem of combining them has been of profound interest at least since the 90s, and different approaches have been employed to…
We introduce the notion of a distributive law between a relative monad and a monad. We call this a relative distributive law and define it in any 2-category $\mathcal{K}$. In order to do that, we introduce the 2-category of relative monads…
We introduce the notion of Rota-Baxter coalgebra which can be viewed as the dual notion of Rota-Baxter algebra. We provide some concrete examples and establish various properties of this new object. We also consider comodules over…
A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability. At a technical level, the problem arises from the fact that there is a no distributive law between the powerset monad and…
Fix a monoidal category C. The 2-category of monads in the 2-category of C-actegories, colax C-equivarant functors, and C-equivariant natural transformations of colax functors, may be recast in terms of pairs consisting of a usual monad and…
Given a monad and a comonad, one obtains a distributive law between them from lifts of one through an adjunction for the other. In particular, this yields for any bialgebroid the Yetter-Drinfel'd distributive law between the comonad given…
Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the…
Beck's distributive laws provide sufficient conditions under which two monads can be composed, and monads arising from distributive laws have many desirable theoretical properties. Unfortunately, finding and verifying distributive laws, or…
Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the…
Circuit algebras are a symmetric version of Jones's planar algebras. They originated in quantum topology as a framework for encoding virtual crossings. This paper extends existing results for modular operads to construct a graphical…
Distributive laws are a standard way of combining two monads, providing a compositional approach for reasoning about computational effects in semantics. Situations where no such law exists can sometimes be handled by weakening the notion of…
For a quantaloid $\mathcal{Q}$, considered as a bicategory, Walters introduced categories enriched in $\mathcal{Q}$. Here we extend the study of monad-quantale-enriched categories of the past fifteen years by introducing…