Related papers: Distributive laws for relative monads
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…
For a small quantaloid $\mathcal{Q}$ we consider four fundamental 2-monads $\mathbb{T}$ on $\mathcal{Q}\text{-}{\bf Cat}$, given by the presheaf 2-monad $\mathbb{P}$ and the copresheaf 2-monad $\mathbb{P}^{\dagger}$, as well as by their two…
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…
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…
A weak entwining structure in a 2-category K consists of a monad t and a comonad c, together with a 2-cell relating both structures in a way that generalizes a mixed distributive law.A weak entwining structure can be characterized as a…
The topic of this thesis is the application of distributive laws between comonads to the theory of cyclic homology. Explicitly, our main aims are: 1) To study how the cyclic homology of associative algebras and of Hopf algebras in the…
We give a lightweight alternative construction of Jacobs's distributive law for multisets and distributions that does not involve any combinatorics. We first give a distributive law for lists and distributions, then apply a general theorem…
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…
We give a 3-categorical, purely formal argument explaining why on the category of Kleisli algebras for a lax monoidal monad, and dually on the category of Eilenberg-Moore algebras for an oplax monoidal monad, we always have a natural…
We study a family of distributors-induced bicategorical models of lambda-calculus, proving that they can be syntactically presented via intersection type systems. We first introduce a class of 2-monads whose algebras are monoidal categories…
A general result relating skew monoidal structures and monads is proved. This is applied to quantum categories and bialgebroids. Ordinary categories are monads in the bicategory whose morphisms are spans between sets. Quantum categories…
We develop the formal theory of monads, as established by Street, in univalent foundations. This allows us to formally reason about various kinds of monads on the right level of abstraction. In particular, we define the bicategory of monads…
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…
We develop the theory of relative monads and relative adjunctions in a virtual equipment, extending the theory of monads and adjunctions in a 2-category. The theory of relative comonads and relative coadjunctions follows by duality. While…
We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv$\to$ Cat for the free calculus on a category of terms and rewrites and a 2-monad…
In this paper, we give a novel abstract description of Szabo's polycategories. We use the theory of double clubs -- a generalisation of Kelly's theory of clubs to `pseudo' (or `weak') double categories -- to construct a pseudo-distributive…
We introduce the notion of a relative pseudomonad, which generalises the notion of a pseudomonad, and define the Kleisli bicategory associated to a relative pseudomonad. We then present an efficient method to define pseudomonas on the…
The Eilenberg-Moore constructions and a Beck-type theorem for pairs of monads are described. More specifically, a notion of a {\em Morita context} comprising of two monads, two bialgebra functors and two connecting maps is introduced. It is…
Recently, Boehm and Stefan constructed duplicial (paracyclic) objects from distributive laws between (co)monads. Here we define the category of factorisations of a distributive law, show that it acts on this construction, and give some…
We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial Steiner triple systems, respectively. As a simple application…