AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.instFunctor

instanceimported Lean

Cslib.FreeM.instFunctor

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
instance Cslib.FreeM.instFunctor : Functor (FreeM F)
Defined in
CSLib, `Cslib.FreeM.instFunctor`
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 5
  • Cslib.FreeM.mapMap a function over a FreeM monad. The builtin <$> notation should be preferred when α and β are in the same universe.
  • Cslib.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by Bind.bind.
  • Cslib.FreeM.instBindCslib.FreeM.instBind
  • 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 95

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
instance Cslib.FreeM.instFunctor : Functor (FreeM F) where
  map := .map
See it in the graphDiscuss this resultChallenge it