Exact compilation of deterministic structured blocks into the recovery interpreter
ProvedStableMSR.Recovery.Compiler.compiler_execution_exactEvery structured command compiles to a finite deterministic program. Whenever a finite structured derivation executes a command from store to store with exact charge , the compiled program, started at program counter zero and any work clock , halts in exactly actual interpreter steps with the full store data of and work clock . The extra instruction is the final halt. The equality holds for every distance oracle and random tape. Rational real literals and the absence of random primitives are guaranteed syntactically. This theorem does not assert termination of arbitrary loops: finite execution evidence is an explicit premise.
Preamble
import Definitions.Def_StableMSR_StructuredCompiler open StableMSR.Recovery StableMSR.Recovery.Compiler
Formal statement
theorem StableMSR.Recovery.Compiler.compiler_execution_exact (cmd : Cmd) (result : ℕ) :
DeterministicProgram (compile cmd result) ∧
∀ (n : ℕ) (d : Point n → Point n → ℝ) (s t : Store) (cost : ℕ),
Executes d cmd s t cost → ∀ (ω : ℕ → ℝ) (work : ℕ),
(MinSumFPT.step (compile cmd result) d ω)^[cost+1] (s.state 0 work) =
t.haltedState cmd.size (work+cost+1) result := by sorrySource
Structured compiler underlying the accepted array_minimum_program proof https://prove2.me/theorems/0aea05ce-c128-4474-ad63-c10e32c5a519; reusable exact interpreter simulation for the Exact Sum-of-Radii Clustering under Any Constant Stability mission.