Equations
- Determinize.Proof.FiniteModel.primitiveArity (Determinize.Spec.Paper.Op.discrete arity) = 0
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.poisson = 1
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.bernoulli = 1
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.exponential = 1
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.uniform = 2
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.gaussian = 2
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.beta = 2
- Determinize.Proof.FiniteModel.primitiveArity Determinize.Spec.Paper.Op.gamma = 2
Instances For
Equations
- One or more equations did not get rendered due to their size.
- Determinize.Proof.FiniteModel.FrameShape x✝ = True
Instances For
theorem
Determinize.Proof.FiniteModel.reduce_frameExpr
(frame : Finite.Frame)
(shape : FrameShape frame)
(hole : Spec.Paper.Expr)
(notValue : hole.isValue = false)
:
(frameExpr frame hole).isValue = false ∧ Spec.Paper.reduce (frameExpr frame hole) = Spec.Paper.Action.wrap (frameExpr frame) (Spec.Paper.reduce hole)
theorem
Determinize.Proof.FiniteModel.wrap_wrap
(action : Spec.Paper.Action)
(first second : Spec.Paper.Expr → Spec.Paper.Expr)
:
Spec.Paper.Action.wrap second (Spec.Paper.Action.wrap first action) = Spec.Paper.Action.wrap (second ∘ first) action
theorem
Determinize.Proof.FiniteModel.reduce_stackExpr
(stack : List Finite.Frame)
(shape : ∀ frame ∈ stack, FrameShape frame)
(hole : Spec.Paper.Expr)
(notValue : hole.isValue = false)
:
(stackExpr stack hole).isValue = false ∧ Spec.Paper.reduce (stackExpr stack hole) = Spec.Paper.Action.wrap (stackExpr stack) (Spec.Paper.reduce hole)
theorem
Determinize.Proof.FiniteModel.reduce_frameExpr_of_absorbing
(frame : Finite.Frame)
(hole : Spec.Paper.Expr)
(notValue : hole.isValue = false)
(absorbing : Spec.Paper.reduce hole = Spec.Paper.Action.next hole)
:
(frameExpr frame hole).isValue = false ∧ Spec.Paper.reduce (frameExpr frame hole) = Spec.Paper.Action.next (frameExpr frame hole)
Evaluation frames preserve an absorbing nonvalue, including a rejection.
theorem
Determinize.Proof.FiniteModel.reduce_stackExpr_of_absorbing
(stack : List Finite.Frame)
(hole : Spec.Paper.Expr)
(notValue : hole.isValue = false)
(absorbing : Spec.Paper.reduce hole = Spec.Paper.Action.next hole)
:
(stackExpr stack hole).isValue = false ∧ Spec.Paper.reduce (stackExpr stack hole) = Spec.Paper.Action.next (stackExpr stack hole)
theorem
Determinize.Proof.FiniteModel.outputMeasureAt_eq_zero_of_absorbing
(expression : Spec.Paper.Expr)
(notValue : expression.isValue = false)
(absorbing : Spec.Paper.reduce expression = Spec.Paper.Action.next expression)
(fuel : ℕ)
:
theorem
Determinize.Proof.FiniteModel.domainSafe_of_absorbing
(expression : Spec.Paper.Expr)
(notValue : expression.isValue = false)
(absorbing : Spec.Paper.reduce expression = Spec.Paper.Action.next expression)
:
Spec.Paper.DomainSafe expression
theorem
Determinize.Proof.FiniteModel.step_eval_reject
(environment : List Finite.Value)
(stack : List Finite.Frame)
:
Finite.step (Finite.State.eval Spec.Paper.Expr.reject environment stack) = Except.ok (Finite.Step.next Finite.Evidence.evaluate [(1, Finite.State.rejected)]) ∧ Spec.Paper.bigStepMeasure (stateExpr (Finite.State.eval Spec.Paper.Expr.reject environment stack)) = Spec.Paper.bigStepMeasure (stateExpr Finite.State.rejected) ∧ Spec.Paper.DomainSafe (stateExpr (Finite.State.eval Spec.Paper.Expr.reject environment stack))
Dropping a machine stack on rejection agrees with the paper output law. The paper expression need not reduce to a bare rejection.