in this work, we describe an adjunction between the comma category of set-based monads under the v -powerset monad and the category of associative lax extensions of set-based monads to the category of v -relations. in the process, we give a general construction of the kleisli extension of a monad to the category of v-relations.

Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monads. We identify the EilenbergMoore category of algebras for parameterised monads and prove a generalisation of Beck’s theorem characterising this category. We demonstrate an application of this theory to the semantics of type an...

The centre of a monoidal category is a braided monoidal category. Monoidal categories are monoidal objects (or pseudomonoids) in the monoidal bicategory of categories. This paper provides a universal construction in a braided monoidal bicategory that produces a braided monoidal object from any monoidal object. Some properties and sufficient conditions for existence of the construction are exami...

We construct a ‘weak’ version EMw(K ) of Lack & Street’s 2-category of monads in a 2-category K , by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between monads in EMw(K ) and composite pre-monads in K is discussed. If K admits Eilenberg-Moore constructions for monads, we define two symmetrical notions of ‘wea...

1 Monoidal ∞-Categories 4 1.1 Monoidal Structures and Algebra Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Cartesian Monoidal Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3 Subcategories of Monoidal ∞-Categories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 1.4 Free Algebras . . . . . . . . . . . . . . . . . . ....

1 Monoidal ∞-Categories 4 1.1 Monoidal Structures and Algebra Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Cartesian Monoidal Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3 Subcategories of Monoidal ∞-Categories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 1.4 Free Algebras . . . . . . . . . . . . . . . . . . ....

1 Monoidal ∞-Categories 4 1.1 Monoidal Structures and Algebra Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Cartesian Monoidal Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3 Subcategories of Monoidal ∞-Categories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 1.4 Free Algebras . . . . . . . . . . . . . . . . . . ....

The use of monads to structure functional programs is de scribed Monads provide a convenient framework for simulating e ects found in other languages such as global state exception handling out put or non determinism Three case studies are looked at in detail how monads ease the modi cation of a simple evaluator how monads act as the basis of a datatype of arrays subject to in place update and ...

Monads provide a greatly useful capability to pure languages in simulating side-effects, but implementations such as the Monad Transformer Library [1] in Haskell prohibit reuse of those side-effects such as threading through two different states without some explicit workaround. Monad Factory provides a straightforward solution for opening the non-proper morphisms by indexing monads at both the...