The identity monad as a free monad...

What is the mathematical theory or theorem underlying join of monad?...

The list monad is not a free monad but …...

Morphism, product, coproduct operator precedence and associativity...

Is monad bind (>>=) operator closer to function composition (chaining) or function application...

Are codatatypes really terminal algebras?...

How are Haskell Monad laws derived from Monoid laws?...

Lambda Calculus vs Category theory in FP...

Is Haskell's `Const` Functor analogous to the constant functor from category theory?...

Reader functor in C++...

What is the main difference between Free Monoid and Monoid?...

Is there any general functor (not limited to endofunctor) usage in programming?...

Is every type constructor (`Type -> Type`) some kind of functor...

Composing F-Algebra[F, A] to F-Algebra[F, Seq[A]]...

Why do Static Arrows generalise Arrows?...

How is `arr fst` a natural transformation?...

Structurally enforced Free Alternative, without left distributivity...

If MonadPlus is the "generator" class, then what is the "consumer" class?...

Lax monoidal functors with a different monoidal structure...

Is there a Codensity MonadPlus that asymptotically optimizes a sequence of MonadPlus operations?...

Is every Alternative Monad Filterable?...

Background on Agda Categories library?...

Recursion scheme allowing dependencies between recursive calls (an ordered catamorphism?)...

Category Theory fundamentals...

Understanding of bifunctor from Category Theory for Programmers - Ch. 8...

Does each type have a unique catamorphism?...

What is monoid homomorphism exactly?...

How can we build explicit categories in Haskell?...

Difference between initial and terminal objects in a category...

If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR...