- add : BinaryOp.add.CanError
- sub : BinaryOp.sub.CanError
- mul : BinaryOp.mul.CanError
- getTag : BinaryOp.getTag.CanError
Instances For
- val {v : Value} {ty : Validation.CedarType} : (Residual.val v ty).ErrorFree
- var {v : Var} {ty : Validation.CedarType} : (Residual.var v ty).ErrorFree
- unary {x₁ : Residual} {op : UnaryOp} {ty : Validation.CedarType} : ¬op.CanError → x₁.ErrorFree → (unaryApp op x₁ ty).ErrorFree
- binary {x₁ x₂ : Residual} {op : BinaryOp} {ty : Validation.CedarType} : ¬op.CanError → x₁.ErrorFree → x₂.ErrorFree → (binaryApp op x₁ x₂ ty).ErrorFree
- and {x₁ x₂ : Residual} {ty : Validation.CedarType} : x₁.ErrorFree → x₂.ErrorFree → (x₁.and x₂ ty).ErrorFree
- or {x₁ x₂ : Residual} {ty : Validation.CedarType} : x₁.ErrorFree → x₂.ErrorFree → (x₁.or x₂ ty).ErrorFree
- ite {x₁ x₂ x₃ : Residual} {ty : Validation.CedarType} : x₁.ErrorFree → x₂.ErrorFree → x₃.ErrorFree → (x₁.ite x₂ x₃ ty).ErrorFree
- hasAttr {x₁ : Residual} {attr : Attr} {ty : Validation.CedarType} : x₁.ErrorFree → (x₁.hasAttr attr ty).ErrorFree
- set {rs : List Residual} {ty : Validation.CedarType} : (∀ (r : Residual), r ∈ rs → r.ErrorFree) → (Residual.set rs ty).ErrorFree
- record {axs : List (Attr × Residual)} {ty : Validation.CedarType} : (∀ (ax : Attr × Residual), ax ∈ axs → ax.snd.ErrorFree) → (Residual.record axs ty).ErrorFree
Instances For
@[irreducible]
@[irreducible]
theorem
Cedar.Thm.error_free_evaluate_ok
{req : Spec.Request}
{es : Spec.Entities}
{env : Validation.TypeEnv}
{r : Spec.Residual}
:
InstanceOfWellFormedEnvironment req es env →
Residual.WellTyped env r → r.ErrorFree → Except.isOk (r.evaluate req es) = true