Proofs #
The proofs of the theorems in Determinize.Theorems. A reviewer need not read them: the build
fails if a theorem uses an axiom other than propext, Classical.choice and Quot.sound, or if
its statement relies on anything from these modules other than proofs.
Determinize/Proof/Primitives/: distribution laws, kernels, masses, and moments.Determinize/Proof/Semantics/: expression measurability, evaluator kernels, and type safety.Determinize/Proof/Symbolic/: affine expressions, symbolic reduction, and its invariants.Determinize/Proof/Traces/: detailed and compact traces, replay, and conditional laws.Determinize.Proof.Soundness,Determinize.Proof.Corollaries,Determinize.Proof.Normalization: the output-law theorems, derived from trace soundness.Determinize/Proof/Frontend/: soundness, optimality and completeness of affinity inference.Determinize/Proof/FiniteModel/,Determinize/Proof/RewardModel/: correspondence of finite and reward models with programs, and soundness of their certificates.Determinize/Proof/LinearAlgebra/: Gaussian elimination with a proof of the original equations.Determinize.Proof.Examples,Determinize.Proof.InterfaceChecks: coverage examples, and checks of the evaluator through public imports only.