AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.liftM

defimported Lean

Interpret a FreeM P computation into any monad m by providing an interpretation interp : (a : P.A) → m (P.B a) for each operation.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
protected def PFunctor.FreeM.liftM [Pure m] [Bind m] (interp : (a : P.A) → m (P.B a)) : P.FreeM α → m α
Defined in
CSLib, `PFunctor.FreeM.liftM`
Lean proof
By Quang Dao, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Quang Dao. 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 1
  • PFunctor.FreeMThe free monad on a polynomial functor. This extends WType with an extra pure constructor.
Used by 12

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
/-- Interpret a `FreeM P` computation into any monad `m` by providing an interpretation `interp : (a : P.A) → m (P.B a)` for each operation. -/
protected def PFunctor.FreeM.liftM [Pure m] [Bind m] (interp : (a : P.A) → m (P.B a)) : P.FreeM α → m α
  | .pure a => pure a
  | .liftBind a cont => interp a >>= fun u ↦ (cont u).liftM interp
See it in the graphDiscuss this resultChallenge it