Cslib.URM.halts_iff_normalizable
theoremverifiedformalizationimported Lean
Halting is equivalent to normalizability in the reduction system.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable (p : Program) in theorem Cslib.URM.halts_iff_normalizable {p : Program} {inputs : List ℕ} : Halts p inputs ↔ Relation.Normalizable (Step p) (State.init inputs)
- Formalizes
- CSLib, `Cslib.URM.halts_iff_normalizable`
- Lean proof
- By Jesse Alama, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Jesse Alama. 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.URM.halts_iff_normalizable← Cslib.URM.halts_iff_normalizable (Cslib/Computability/URM/Execution.lean:178): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- Cslib.URM.State.instDecidableIsHaltedCslib.URM.State.instDecidableIsHalted
- Cslib.URM.State.initInitial state for a program with given inputs. The program counter starts at 0, and inputs are loaded into registers 0, 1, ....
- Cslib.URM.HaltsA program halts on given inputs if execution reaches a halted state. This is equivalent to
(Step p).Normalizable (State.init inputs)—… - Cslib.URM.State.instInhabitedCslib.URM.State.instInhabited
- Cslib.URM.isHalted_iff_normalA state is halted iff it is normal (has no successor) in the reduction system.
- Relation.NormalizableAn element is normalizable if it is related to a normal element.
- Cslib.URM.State.instReprCslib.URM.State.instRepr
- Cslib.URM.StepSingle-step execution relation for URMs. Each constructor corresponds to one of the four instruction types: -
zero: ExecuteZ n(set… - Cslib.URM.StateMachine state: program counter (0-indexed) and register contents.
- Cslib.URM.ProgramA URM program is a list of instructions.
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 invariable (p : Program) in/-- Halting is equivalent to normalizability in the reduction system. -/theorem Cslib.URM.halts_iff_normalizable {p : Program} {inputs : List ℕ} : Halts p inputs ↔ Relation.Normalizable (Step p) (State.init inputs) := by grind [Halts, isHalted_iff_normal]