Documentation

Determinize.Proof.Frontend.Inference

Soundness, optimality, and completeness of affinity inference #

The proof of Theorems.inference_correctness, assembled from the lemmas of the other files in Proof/Frontend/:

The phases of inference #

@[reducible, inline]

The atomic affinity constraints of a draft under the shapes θ.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    Soundness #

    Completeness and optimality #

    A typed completion determines a solution of inference above it.

    The statement #

    theorem Determinize.Proof.Frontend.infer_correct (input : Spec.Paper.Input) :
    match Frontend.infer input with | Except.error a => ¬∃ (program : Spec.Paper.Annotated), Spec.Completion input program | Except.ok (program, ty) => input.Matches program ∧ Spec.Paper.Typed [] (Spec.Paper.interpret ↑program) ty ∧ ∀ (completion : Spec.Paper.Annotated), Spec.Completion input completion → Spec.AffinityLE completion program