Cslib.URM.straight_line_halts_from_regs
theoremverifiedformalizationimported Lean
Straight-line programs halt from any starting registers, not just State.init. Useful for chaining: after running one program, we can run the next straight-line segment from whatever registers we're in.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem Cslib.URM.straight_line_halts_from_regs {p : Program} (hsl : p.IsStraightLine) (r : Regs) : ∃ s, Steps p ⟨0, r⟩ s ∧ s.isHalted p ∧ s.pc = p.length
- Formalizes
- CSLib, `Cslib.URM.straight_line_halts_from_regs`
- 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.straight_line_halts_from_regs← Cslib.URM.straight_line_halts_from_regs (Cslib/Computability/URM/StraightLine.lean:83): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 22
- Cslib.URM.State.instDecidableIsHaltedCslib.URM.State.instDecidableIsHalted
- Cslib.URM.InstrURM instructions. -
Z n: Set register n to zero -S n: Increment register n by one -T m n: Transfer (copy) the contents of register… - Cslib.URM.State.isHalted_iffCslib.URM.State.isHalted_iff
- Cslib.URM.Instr.IsJumpAn instruction is a jump instruction.
- Cslib.URM.StepsMulti-step execution: the reflexive-transitive closure of
Step. - Cslib.URM.State.isHaltedA state is halted if the program counter is at or beyond the program length.
- Cslib.URM.Step.of_nonJumpA non-jumping instruction produces a step that increments PC by 1.
- Cslib.URM.RegsRegister contents: maps register indices to natural number contents. Uses the functional representation
ℕ → ℕfor efficiency with… - Cslib.URM.Regs.write_read_selfCslib.URM.Regs.write_read_self
- Cslib.URM.Instr.instDecidableIsJumpCslib.URM.Instr.instDecidableIsJump
- Cslib.URM.State.instInhabitedCslib.URM.State.instInhabited
- Cslib.URM.instSetoidProgramSetoid instance for programs, enabling the ≈ notation.
- Cslib.URM.Regs.write_read_of_neCslib.URM.Regs.write_read_of_ne
- Cslib.URM.Instr.instDecidableJumpsBoundedByCslib.URM.Instr.instDecidableJumpsBoundedBy
- Cslib.URM.instDecidableIsStraightLineCslib.URM.instDecidableIsStraightLine
- 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.Program.IsStraightLineA program is "straight-line" if it contains no jump instructions.
- Cslib.URM.StateMachine state: program counter (0-indexed) and register contents.
- Cslib.URM.ProgramA URM program is a list of instructions.
- Cslib.URM.Regs.readRead the contents of register n.
- Cslib.URM.Regs.writeWrite value v to register n.
- Used by 3
- Cslib.URM.straightLinefinalState_specSpecification: the state from straightLinefinalState satisfies Steps, isHalted, and has pc = p.length.
- Cslib.URM.straight_line_haltsA straight-line program halts on any input.
- Cslib.URM.straightLinefinalStateThe halting state for a straight-line program starting from registers r. Wraps Classical.choose to hide it from the API.
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 in/-- Straight-line programs halt from any starting registers, not just State.init. Useful for chaining: after running one program, we can run the next straight-line segment from whatever registers we're in. -/theorem Cslib.URM.straight_line_halts_from_regs {p : Program} (hsl : p.IsStraightLine) (r : Regs) : ∃ s, Steps p ⟨0, r⟩ s ∧ s.isHalted p ∧ s.pc = p.length := by suffices h : ∀ s : State, s.pc ≤ p.length → ∃ s', Steps p s s' ∧ s'.pc = p.length by obtain ⟨s', hsteps, hpc'⟩ := h ⟨0, r⟩ (Nat.zero_le _) exact ⟨s', hsteps, Nat.le_of_eq hpc'.symm, hpc'⟩ intro s hpc_le generalize hrem : p.length - s.pc = remaining induction remaining using Nat.strong_induction_on generalizing s with | h n ih => by_cases hhalted : s.pc ≥ p.length · grind · have jmp : ¬p[s.pc].IsJump := by apply hsl; grind have := Step.of_nonJump (by lia) jmp grind [Relation.ReflTransGen.head]