Related papers: Parametric Distributive Laws: uniform monad compos…
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…
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…
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…
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…
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,…
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…
Containers are used to carve out a class of strictly positive data types in terms of shapes and positions. They can be interpreted via a fully-faithful functor into endofunctors on Set. Monadic containers are those containers whose…
In recent years, algebraic studies of the differential calculus and integral calculus in the forms of differential algebra and Rota-Baxter algebra have been merged together to reflect the close relationship between the two calculi through…
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…
We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concretely builds a distributive law between two monads, i.e.…
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…
We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax…
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
Given two monads $S$, $T$ on a category where idempotents split, and a weak distributive law between them, one can build a combined monad $U$. Making explicit what this monad $U$ is requires some effort. When we already have an idea what…
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…
In this paper we consider the conditions that need to be satisfied by two families of pseudofunctors with a common codomain for them to be collated into a bifunctor. We observe similarities between these conditions and distributive laws of…
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 extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…
This work presents a detailed analysis of the combinatorics of modular operads. These are operad-like structures that admit a contraction operation as well as an operadic multiplication. Their combinatorics are governed by graphs that admit…
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…