Source lean/Determinize/Proof/FiniteModel/Administrative.lean
import Determinize.Proof.FiniteModel.Reductionnamespace Determinize.Proof.FiniteModelopen Spec.Paper Determinize.Finite Checking Binding/-- Machine bookkeeping may leave the represented paper expression unchanged. -/def AdministrativeStep (evidence : Evidence) (before after : State) : Prop :=  step before = .ok (.next evidence [(1, after)]) ∧ stateExpr before = stateExpr aftertheorem environmentExpr_eq_map (environment : List Value) :    environmentExpr environment = environment.map valueExpr := by  induction environment <;> simp_all [environmentExpr]theorem administrativeStep_variable (environment : List Value) (stack : List Frame) (index : Nat)    (value : Value)    (lookup : environment[index]? = some value) :    AdministrativeStep .evaluate (.eval (.bvar index) environment stack)        (.deliver value stack) := by  constructor  · simp [step, lookup]; rfl  · simp [stateExpr, interpret, close, Expr.map, Expr.mapVars,      environmentExpr_eq_map, List.getElem?_map, lookup]theorem administrativeStep_binary (operation : Binary) (left right : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (binaryExpr operation left right) environment stack)      (.eval left environment (.left operation right environment :: stack)) := by  cases operation <;> refine ⟨rfl, ?_⟩ <;>    simp [stateExpr, stackExpr, frameExpr, binaryExpr, close, Expr.mapVars, interpret, Expr.map]theorem administrativeStep_unary (operation : Unary) (body : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (unaryExpr operation body) environment stack)      (.eval body environment (.unary operation :: stack)) := by  cases operation <;> refine ⟨rfl, ?_⟩ <;>    simp [stateExpr, stackExpr, frameExpr, unaryExpr, close, Expr.mapVars, interpret, Expr.map]theorem administrativeStep_left_argument (operation : Binary) (right : Core) (left : Value)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .continue (.deliver left (.left operation right environment :: stack))      (.eval right environment (.right operation left :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr]theorem administrativeStep_closure (body : Core) (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.lam body) environment stack)      (.deliver (.closure body environment) stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_recursive (body : Core) (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.fix body) environment stack)      (.deliver (.recursive body environment) stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_let (value body : Core) (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.letE value body) environment stack)      (.eval value environment (.letBody body environment :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_branch (condition yes no : Core) (environment : List Value)    (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.ite condition yes no) environment stack)      (.eval condition environment (.choose yes no environment :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_sum (value left right : Core) (environment : List Value)    (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.matchSum value left right) environment stack)      (.eval value environment (.matchSum left right environment :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_list (value nilCase consCase : Core) (environment : List Value)    (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.matchList value nilCase consCase) environment stack)      (.eval value environment (.matchList nilCase consCase environment :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_draw_argument (site : DistributionAction × Op) (next : Core)    (rest : List Core)    (arguments : List Rat) (value : Rat) (environment : List Value) (stack : List Frame) :    AdministrativeStep .continue      (.deliver (.number value) (.draw site (next :: rest) environment arguments :: stack))      (.eval next environment (.draw site rest environment (arguments ++ [value]) :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, valueExpr, List.map_append, List.append_assoc]theorem administrativeStep_number (value : Rat) (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.real value) environment stack)        (.deliver (.number value) stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_bool (value : Bool) (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.bool value) environment stack)        (.deliver (.bool value) stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_unit (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval .unit environment stack) (.deliver .unit stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_nil (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval .nil environment stack) (.deliver .nil stack) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, valueExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_uniform (kind : DistributionAction) (left right : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.uniform kind left right) environment stack)      (.eval left environment (.draw (kind, .uniform) [right] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_gaussian (kind : DistributionAction) (left right : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.gaussian kind left right) environment stack)      (.eval left environment (.draw (kind, .gaussian) [right] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_beta (kind : DistributionAction) (left right : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.beta kind left right) environment stack)      (.eval left environment (.draw (kind, .beta) [right] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_gamma (kind : DistributionAction) (left right : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.gamma kind left right) environment stack)      (.eval left environment (.draw (kind, .gamma) [right] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_poisson (kind : DistributionAction) (argument : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.poisson kind argument) environment stack)      (.eval argument environment (.draw (kind, .poisson) [] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_bernoulli (kind : DistributionAction) (argument : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.bernoulli kind argument) environment stack)      (.eval argument environment (.draw (kind, .bernoulli) [] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_exponential (kind : DistributionAction) (argument : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.exponential kind argument) environment stack)      (.eval argument environment (.draw (kind, .exponential) [] environment [] :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, primitiveExpr, close, interpret, Expr.map, Expr.mapVars]theorem administrativeStep_discrete (kind : DistributionAction) (probabilities : Core)    (environment : List Value) (stack : List Frame) :    AdministrativeStep .evaluate (.eval (.discrete kind probabilities) environment stack)      (.eval probabilities environment (.discrete kind :: stack)) := by  refine ⟨rfl, ?_⟩  simp [stateExpr, stackExpr, frameExpr, close, interpret, Expr.map, Expr.mapVars]end Determinize.Proof.FiniteModel