For a concrete transformer 𝐹:𝐶→𝐶, an abstract transformer 𝐹♯:𝐴→𝐴, and a monotone concretization 𝛾:𝐴→𝐶, the local simulation obligation is 𝐹𝛾⊑𝛾𝐹♯. If both transformers are monotone on complete lattices, fixed-point transfer gives lfp(𝐹)⊑𝛾(lfp(𝐹♯)). Any checked 𝐴 satisfying 𝐹♯(𝐴)⊑𝐴 is likewise sound: Park induction gives lfp(𝐹)⊑𝛾(𝐴).
The structural analyzer returns a pair (𝗉𝗈𝗌𝗍♯(𝑐,𝐴),𝖾𝗋𝗋♯(𝑐,𝐴)). Its terminal-store and error obligations are ⟨𝑐,𝜎⟩⟶∗⟨𝐬𝐤𝐢𝐩,𝜎′⟩⟹𝜎′∈𝛾𝗌𝗍(𝗉𝗈𝗌𝗍♯(𝑐,𝐴)),⟨𝑐,𝜎⟩⟶∗𝖾𝗋𝗋𝗈𝗋⟹𝖾𝗋𝗋♯(𝑐,𝐴)=𝗍𝗋𝗎𝖾. Tests must satisfy Assume-Sound; loops use a pre-fixed invariant. An interval widening drops a decreasing lower endpoint to −∞ and an increasing upper endpoint to +∞. DBM copy-plus-constant assignment updates, for every node 𝑤, 𝐷′𝑥𝑤=𝐷𝑦𝑤+𝑘,𝐷′𝑤𝑥=𝐷𝑤𝑦−𝑘,𝐷′𝑥𝑥=0, and then closes the matrix. Entrywise DBM extrapolation drops every weakened finite entry to +∞ and therefore terminates on a finite matrix.
The CESK-star comparison uses the simply typed source rules
Γ,𝑥:𝐴⊢𝑒:𝐵
Γ⊢𝜆𝑥.𝑒:𝐴→𝐵
Ty-Abs
Γ⊢𝑒1:𝐴→𝐵Γ⊢𝑒2:𝐴
Γ⊢𝑒1𝑒2:𝐵
Ty-App
Its representative CEK transitions are
⟨𝑒0𝑒1,𝜌,𝜅⟩⟶⟨𝑒0,𝜌,𝖺𝗋(𝑒1,𝜌,𝜅)⟩
CEK-App
𝑣0𝗏𝖺𝗅𝗎𝖾
⟨𝑣0,𝜌,𝖺𝗋(𝑒1,𝜌1,𝜅)⟩⟶⟨𝑒1,𝜌1,𝖿𝗇(𝑣0,𝜅)⟩
CEK-Arg
𝑣1𝗏𝖺𝗅𝗎𝖾
⟨𝑣1,𝜌1,𝖿𝗇(⟨𝜆𝑥.𝑒,𝜌0⟩,𝜅)⟩⟶⟨𝑒,𝜌0[𝑥↦𝑣1],𝜅⟩
CEK-Beta
The three imported theorem cards retain separate signatures: the CESK-star one-step simulation abstracts a concrete machine step; Move’s borrow-graph theorem preserves 𝖨𝗇𝗏(𝑠,𝖠𝖻𝗌(𝑠)); Verasco’s vanalysis_correct excludes 𝖦𝗈𝖾𝗌_𝗐𝗋𝗈𝗇𝗀 after the five section parameters and result (𝗍𝗍,𝗇𝗂𝗅) are fixed.