What Makes a Strong Monad?

Abstract

Strong monads are important for several applications, in particular, in the denotational semantics of effectful languages, where strength is needed to sequence computations that have free variables. Strength is non-trivial: it can be difficult to determine whether a monad has any strength at all, and monads can be strong in multiple ways. We therefore review some of the most important known facts about strength and prove some new ones. In particular, we present a number of equivalent characterizations of strong functor and strong monad, and give some conditions that guarantee existence or uniqueness of strengths. We look at strength from three different perspectives: actions of a monoidal category V, enrichment over V, and powering over V. We are primarily motivated by semantics of effects, but the results are also useful in other contexts.

arXiv commentIn Proceedings MSFP 2022, arXiv:2206.09534

References in corpus (5)

• Commutative monads as a theory of distributions
• The Giry Monad is not Strong for the Canonical Symmetric Monoidal Closed Structure on Meas
• Eilenberg--Moore Monoids and Backtracking Monad Transformers
• Notions of Monad Strength
• On the tensor product of modules over skew monoidal actegories

Cited by in corpus (6)

• Effectful Semantics in 2-Dimensional Categories: Premonoidal and Freyd Bicategories
• The Quantum Monadology
• Protocol Choice and Iteration for the Free Cornering
• On Graded Monads, Distributive Laws and Costrong Functors
• Exponentiable virtual double categories and presheaves for double categories
• Galois connecting call-by-value and call-by-name