Cslib.FreeM.FreeState.run_toStateM
theoremverifiedformalizationimported Lean
The canonical interpreter toStateM derived from liftM agrees with the hand-written recursive interpreter run for FreeState.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v w w' w'' in variable {σ : Type u} {α : Type v} in @[simp] theorem Cslib.FreeM.FreeState.run_toStateM {α : Type u} (comp : FreeState σ α) (s₀ : σ) : (toStateM comp).run s₀ = pure (run comp s₀)
- Formalizes
- CSLib, `Cslib.FreeM.FreeState.run_toStateM`
- Lean proof
- By Tanner Duve, 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.Cslib.FreeM.FreeState.run_toStateM← Cslib.FreeM.FreeState.run_toStateM (Cslib/Foundations/Control/Monad/Free/Effects.lean:104): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 33
- Cslib.FreeM.FreeState.toStateMConvert a
FreeStatecomputation into aStateMcomputation. This is the canonical interpreter derived fromliftM. - Cslib.FreeM.liftM_seqLeftCslib.FreeM.liftM_seqLeft
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- Cslib.FreeM.FreeState.instMonadStateOfCslib.FreeM.FreeState.instMonadStateOf
- Cslib.FreeM.liftM_seqRightCslib.FreeM.liftM_seqRight
- Cslib.FreeM.liftM_liftCslib.FreeM.liftM_lift
- Cslib.FreeM.liftM_seqCslib.FreeM.liftM_seq
- Cslib.FreeM.FreeState.set_defCslib.FreeM.FreeState.set_def
- Cslib.FreeM.liftM_mapCslib.FreeM.liftM_map
- Cslib.FreeM.FreeState.get_defCslib.FreeM.FreeState.get_def
- Cslib.FreeM.FreeState.runRun a state computation, returning both the result and final state.
- Cslib.FreeM.FreeStateState monad via the
FreeMmonad. - Cslib.FreeMThe Free monad over a type constructor
F. AFreeM F ais a tree of operations from the type constructorF, with leaves of typea.… - Cslib.FreeM.StateFType constructor for state operations.
- Cslib.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandιare in the same universe, this… - Cslib.FreeM.pure_eq_pureCslib.FreeM.pure_eq_pure
- Cslib.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by
Functor.map. - Cslib.FreeM.liftBind_eqCslib.FreeM.liftBind_eq
- Cslib.FreeM.pure_bind
.pure afollowed bybindcollapses immediately. - Cslib.FreeM.bind_pureCslib.FreeM.bind_pure
- Cslib.FreeM.bind_pure_compCslib.FreeM.bind_pure_comp
- Cslib.FreeM.map_pureCslib.FreeM.map_pure
- Cslib.FreeM.map_bindCslib.FreeM.map_bind
- Cslib.FreeM.id_mapCslib.FreeM.id_map
- Cslib.FreeM.liftM_pureCslib.FreeM.liftM_pure
- Cslib.FreeM.liftM_lift_bindCslib.FreeM.liftM_lift_bind
- Cslib.FreeM.instPureCslib.FreeM.instPure
- Cslib.FreeM.instBindCslib.FreeM.instBind
- Cslib.FreeM.instFunctorCslib.FreeM.instFunctor
- Cslib.FreeM.instLawfulFunctorCslib.FreeM.instLawfulFunctor
- Cslib.FreeM.instMonadCslib.FreeM.instMonad
- Cslib.FreeM.instLawfulMonadCslib.FreeM.instLawfulMonad
- Cslib.FreeM.FreeState.toStateMConvert a
- Used by 33
- Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- Cslib.FreeM.FreeWriter.pass_defCslib.FreeM.FreeWriter.pass_def
- Cslib.FreeM.FreeState.run_pureCslib.FreeM.FreeState.run_pure
- Cslib.FreeM.FreeState.run'_setCslib.FreeM.FreeState.run'_set
- Cslib.FreeM.FreeReader.run_pureCslib.FreeM.FreeReader.run_pure
- Cslib.FreeM.FreeWriter.pass
passallows a subcomputation to modify its own log. After traversing the computation and accumulating its log, the resulting function is… - Cslib.FreeM.FreeReader.run_withReaderCslib.FreeM.FreeReader.run_withReader
- Cslib.FreeM.FreeWriter.run_lift_tellCslib.FreeM.FreeWriter.run_lift_tell
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- Cslib.FreeM.FreeState.run'_pureCslib.FreeM.FreeState.run'_pure
- Cslib.FreeM.FreeWriter.listen_pureCslib.FreeM.FreeWriter.listen_pure
- Cslib.FreeM.FreeWriter.run_pureCslib.FreeM.FreeWriter.run_pure
- Cslib.FreeM.FreeWriter.listen
listencaptures the log produced by a subcomputation incrementally. It traverses the computation, emitting log entries as encountered,… - Cslib.FreeM.FreeState.run'_getCslib.FreeM.FreeState.run'_get
- Cslib.FreeM.FreeCont.run_pureCslib.FreeM.FreeCont.run_pure
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- Cslib.FreeM.FreeState.run_setCslib.FreeM.FreeState.run_set
- Cslib.FreeM.FreeCont.run_toContTThe canonical interpreter
toContTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeCont. - Cslib.FreeM.FreeCont.run_callCC
runof acallCCnode simplifies to running the handler with the current continuation. - Cslib.FreeM.FreeReader.run_bindCslib.FreeM.FreeReader.run_bind
- Cslib.FreeM.FreeReader.run_readCslib.FreeM.FreeReader.run_read
- Cslib.FreeM.FreeCont.callCCCall with current continuation for the Free continuation monad.
- Cslib.FreeM.FreeReader.instMonadWithReaderOfCslib.FreeM.FreeReader.instMonadWithReaderOf
- Cslib.FreeM.FreeState.run'_toStateMCslib.FreeM.FreeState.run'_toStateM
- Cslib.FreeM.FreeCont.instMonadContCslib.FreeM.FreeCont.instMonadCont
- Cslib.FreeM.FreeState.run_getCslib.FreeM.FreeState.run_get
- Cslib.FreeM.FreeWriter.instMonadWriterOfMonoidCslib.FreeM.FreeWriter.instMonadWriterOfMonoid
- Cslib.FreeM.FreeWriter.listen_lift_tell_bindCslib.FreeM.FreeWriter.listen_lift_tell_bind
- Cslib.FreeM.FreeCont.run_lift_callCCCslib.FreeM.FreeCont.run_lift_callCC
- Cslib.FreeM.FreeReader.run_toReaderMThe canonical interpreter
toReaderMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeReader - Cslib.FreeM.FreeWriter.run_toWriterTThe canonical interpreter
toWriterTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeWriter. - Cslib.FreeM.FreeState.run'Run a state computation, returning only the result.
- Cslib.FreeM.FreeState.run'_bindCslib.FreeM.FreeState.run'_bind
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v w w' w'' invariable {σ : Type u} {α : Type v} in/-- The canonical interpreter `toStateM` derived from `liftM` agrees with the hand-written recursive interpreter `run` for `FreeState`. -/@[simp]theorem Cslib.FreeM.FreeState.run_toStateM {α : Type u} (comp : FreeState σ α) (s₀ : σ) : (toStateM comp).run s₀ = pure (run comp s₀) := by induction comp generalizing s₀ with | pure a => rfl | liftBind op cont ih => cases op <;> apply ih