Documentation

Batteries.Lean.LawfulMonadLift

Lawful instances of MonadLift for the Lean monad stack. #

EIO.adapt simp lemmas #

@[simp]
theorem EIO.adapt_pure {ε₁ ε₂ α : Type} (f : ε₁ε₂) (a : α) :
adapt f (pure a) = pure a
@[simp]
theorem EIO.adapt_bind {ε₁ ε₂ α β : Type} (f : ε₁ε₂) (ma : EIO ε₁ α) (g : αEIO ε₁ β) :
adapt f (ma >>= g) = do let aadapt f ma adapt f (g a)

StateRefT'.lift simp lemmas #

@[simp]
theorem StateRefT'.lift_pure {m : TypeType} {α ω σ : Type} [Monad m] (a : α) :
@[simp]
theorem StateRefT'.lift_bind {m : TypeType} {α β ω σ : Type} [Monad m] (ma : m α) (f : αm β) :
StateRefT'.lift (ma >>= f) = do let aStateRefT'.lift ma StateRefT'.lift (f a)

LawfulMonadLift IO CoreM #