AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeCont.run_callCC

theoremverifiedformalizationimported Lean

run of a callCC node simplifies to running the handler with the current continuation.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeCont in
universe u v w w' w'' in
variable {r : Type u} {α : Type v} {β : Type w} in
@[simp]
lemma Cslib.FreeM.FreeCont.run_callCC (f : MonadCont.Label α (FreeCont r) β → FreeCont r α) (k : α → r) :
    run (callCC f) k = run (f ⟨fun x => lift (.callCC fun _ => k x)⟩) k
Formalizes
CSLib, `Cslib.FreeM.FreeCont.run_callCC`
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.
Verified
08 Oct 2026
Axioms
propext
Built on 49
Used by 8

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.FreeM Cslib.FreeM.FreeCont inuniverse u v w w' w'' invariable {r : Type u} {α : Type v} {β : Type w} in/-- `run` of a `callCC` node simplifies to running the handler with the current continuation. -/@[simp]lemma Cslib.FreeM.FreeCont.run_callCC (f : MonadCont.Label α (FreeCont r) β → FreeCont r α) (k : α → r) :    run (callCC f) k = run (f ⟨fun x => lift (.callCC fun _ => k x)⟩) k := by  simp [callCC]
See it in the graphDiscuss this resultChallenge it