Module Polynomial.ProofFormat

Proof format used by the proof-generating procedures. It is fairly close to Rocq format but a bit more liberal.

It is used for proofs over Z, Q, R. However, certain constructions e.g. CutPrf are only relevant for Z.

type prf_rule =
  1. | Annot of string * prf_rule
  2. | Hyp of int
  3. | Def of int
  4. | Ref of int
  5. | Cst of Micromega_core_plugin.NumCompat.Q.t
  6. | Zero
  7. | Square of Vect.t
  8. | MulC of Vect.t * prf_rule
  9. | Gcd of Micromega_core_plugin.NumCompat.Z.t * prf_rule
  10. | MulPrf of prf_rule * prf_rule
  11. | AddPrf of prf_rule * prf_rule
  12. | CutPrf of prf_rule
  13. | LetPrf of prf_rule * prf_rule
type proof =
  1. | Done
  2. | Step of int * prf_rule * proof
  3. | Split of int * Vect.t * proof * proof
  4. | Enum of int * prf_rule * Vect.t * prf_rule * proof list
  5. | ExProof of int * int * int * var * var * var * proof
val normalise_proof : int -> proof -> int * proof
val output_prf_rule : Stdlib.out_channel -> prf_rule -> unit
val output_proof : Stdlib.out_channel -> proof -> unit
val add_proof : prf_rule -> prf_rule -> prf_rule
val mul_proof : prf_rule -> prf_rule -> prf_rule
module Env : sig ... end