Index sorting through the imported heap: named-line observations
DefinitionAlgo_sort_indices_PointsNamed source locations and local-state observations for sort_indices.algo. A standalone source label denotes the state before its following statement. Location predicates and getters describe the supplied configuration without requiring a whole transcript or a reachability hypothesis.
These optional observations help local proofs inspect intermediate states. They are compiled separately from the stable algorithm definitions, so a proof can change labels without changing its main call or output statement.
<!-- algo2lean-provenance-v0.1.4 -->Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.
import Definitions.Def_Algo_sort_indices_Generated set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true -- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean namespace Algo.«sort_indices» open _root_.Algo2LeanGenerated Algo2LeanGenerated -- Named locations are independent of the compiled module body. -- Before source line 14, column 5; location only, not reachability. def sort_indices.At.insert : Configuration → Prop | .active _ (.fn_sort_indices 15 _) _ => True | _ => False -- Before source line 20, column 5; location only, not reachability. def sort_indices.At.extract : Configuration → Prop | .active _ (.fn_sort_indices 4 _) _ => True | _ => False def sort_indices.Local.keys : Configuration → Option SeqRef | .active _ (.fn_sort_indices pc s) _ => if pc = 4 ∨ pc = 15 then some s.v0 else none | _ => none def sort_indices.Element.keys (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«sort_indices».sort_indices.Local.keys state).map (fun ref => state.heap.read ref index) def sort_indices.Local.count : Configuration → Option Int | .active _ (.fn_sort_indices pc s) _ => if pc = 4 ∨ pc = 15 then some s.v1 else none | _ => none def sort_indices.Local.queue : Configuration → Option Ref__a2l_import_0_MinHeap | .active _ (.fn_sort_indices pc s) _ => if pc = 4 ∨ pc = 15 then some s.v2 else none | _ => none def sort_indices.Local.result : Configuration → Option SeqRef | .active _ (.fn_sort_indices pc s) _ => if pc = 4 ∨ pc = 15 then some s.v3 else none | _ => none def sort_indices.Element.result (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«sort_indices».sort_indices.Local.result state).map (fun ref => state.heap.read ref index) def sort_indices.Local.index : Configuration → Option Int | .active _ (.fn_sort_indices pc s) _ => if pc = 4 ∨ pc = 15 then some s.v4 else none | _ => none end Algo.«sort_indices»