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.PFunctor.FreeM.liftM← PFunctor.FreeM.liftM (Cslib/Foundations/Data/PFunctor/Free.lean:269): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor.
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
- Used by 12
- PFunctor.FreeM.liftM_seqLeftPFunctor.FreeM.liftM_seqLeft
- PFunctor.FreeM.Interprets.liftMPFunctor.FreeM.Interprets.liftM
- PFunctor.FreeM.liftM_seqPFunctor.FreeM.liftM_seq
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.Interprets.eqPFunctor.FreeM.Interprets.eq
- PFunctor.FreeM.liftM_seqRightPFunctor.FreeM.liftM_seqRight
- PFunctor.FreeM.liftM_bindPFunctor.FreeM.liftM_bind
- PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
- PFunctor.FreeM.liftM_mapPFunctor.FreeM.liftM_map
- PFunctor.FreeM.Interprets.iffThe universal property of the free monad
P.FreeM. That is,liftM handleris the unique interpreter that extends the effect handler… - PFunctor.FreeM.liftM_purePFunctor.FreeM.liftM_pure
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