Functor Laws, applicative laws, and monad Laws #
Equations
- ReaderT.mk f = f
Instances For
@[simp]
@[simp]
@[simp]
theorem
OptionT.run_map
{α β : Type u}
{m : Type u → Type v}
(x : OptionT m α)
[Monad m]
(f : α → β)
[LawfulMonad m]
:
instance
instLawfulMonadOptionT_mathlib
(m : Type u → Type v)
[Monad m]
[LawfulMonad m]
:
LawfulMonad (OptionT m)