Related papers: No-Go Theorems for Distributive Laws
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…
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…
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…
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…
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…
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…
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,…
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 study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…
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 set functors over the powerset monad (also known as Kleisli laws for the powerset monad) are well-known to be in one-to-one correspondence with extensions of set functors to functors on the category of sets and…
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…
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…
By considering the situation in which the involved pseudomonads are presented in no-iteration form, we deduce a number of alternative presentations of pseudodistributive laws including a 'decagon' form, a pseudoalgebra form, a no-iteration…
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…
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…
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…
We provide a characterization of no-iteration distributive laws in terms of its monads in extensive form only. To do that, it is necessary to take account of both right and left extension systems. We also give, in this right-left…
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…
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…