The Kleisli construction on the Type category

Define the Kleisli category for (control) monads. CategoryTheory/Monad/Kleisli defines the general version for a monad on C, and demonstrates the equivalence between the two.

TODO

Generalise this to work with CategoryTheory.Monad

def CategoryTheory.KleisliCat : (Type u → Type v) → Type (u + 1)

The Kleisli category on the (type-)monad m. Note that the monad is not assumed to be lawful yet.

Equations

• CategoryTheory.KleisliCat x = Type u

def CategoryTheory.KleisliCat.mk (m : Type u → Type u_1) (α : Type u) : CategoryTheory.KleisliCat m

Construct an object of the Kleisli category from a type.

Equations

• CategoryTheory.KleisliCat.mk m α = α

instance CategoryTheory.KleisliCat.categoryStruct {m : Type u → Type v} [Monad m] : CategoryTheory.CategoryStruct.{max u v, u + 1} (CategoryTheory.KleisliCat m)

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.KleisliCat.category {m : Type u → Type v} [Monad m] [LawfulMonad m] : CategoryTheory.Category.{max u v, u + 1} (CategoryTheory.KleisliCat m)

Equations

• CategoryTheory.KleisliCat.category = CategoryTheory.Category.mk ⋯ ⋯ ⋯

@[simp]

theorem CategoryTheory.KleisliCat.id_def {m : Type u_1 → Type u_2} [Monad m] (α : CategoryTheory.KleisliCat m) : CategoryTheory.CategoryStruct.id α = pure

theorem CategoryTheory.KleisliCat.comp_def {m : Type u_1 → Type u_2} [Monad m] (α : CategoryTheory.KleisliCat m) (β : CategoryTheory.KleisliCat m) (γ : CategoryTheory.KleisliCat m) (xs : α ⟶ β) (ys : β ⟶ γ) (a : α) : CategoryTheory.CategoryStruct.comp xs ys a = xs a >>= ys

instance CategoryTheory.instInhabitedKleisliCatIdType : Inhabited (CategoryTheory.KleisliCat id)

Equations

• CategoryTheory.instInhabitedKleisliCatIdType = { default := PUnit.{u_1 + 1} }

instance CategoryTheory.instInhabitedMkIdType {α : Type u} [Inhabited α] : Inhabited (CategoryTheory.KleisliCat.mk id α)

Equations

• CategoryTheory.instInhabitedMkIdType = { default := let_fun this := default; this }