AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.bind

defimported Lean

Bind operation for the FreeM monad. The builtin >>= notation should be preferred when α and β are in the same universe.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
protected def Cslib.FreeM.bind (x : FreeM F α) (f : α → FreeM F β) : FreeM F β
Defined in
CSLib, `Cslib.FreeM.bind`
Lean proof
By Tanner Duve, Eric Wieser, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • Cslib.FreeM.instPureCslib.FreeM.instPure
  • Cslib.FreeMThe Free monad over a type constructor F. A FreeM F a is a tree of operations from the type constructor F, with leaves of type a.…
Used by 21

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
/-- Bind operation for the `FreeM` monad. The builtin `>>=` notation should be preferred when `α` and `β` are in the same universe. -/
protected def Cslib.FreeM.bind (x : FreeM F α) (f : α → FreeM F β) : FreeM F β :=
  match x with
  | .pure a => f a
  | .liftBind op cont => .liftBind op fun z => FreeM.bind (cont z) f
See it in the graphDiscuss this resultChallenge it