AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.map

defimported Lean

Map a function over a FreeM computation. 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 uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
def PFunctor.FreeM.map (f : α → β) : P.FreeM α → P.FreeM β
Defined in
CSLib, `PFunctor.FreeM.map`
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 8

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
/-- Map a function over a `FreeM` computation. The builtin `<$>` notation should be preferred when `α` and `β` are in the same universe. -/
def PFunctor.FreeM.map (f : α → β) : P.FreeM α → P.FreeM β
  | .pure a => .pure (f a)
  | .liftBind a cont => .liftBind a fun u => FreeM.map f (cont u)
See it in the graphDiscuss this resultChallenge it