package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

sha256=b1501d686c21836302191ae30f610cca57fb309214c126518ca009363ad2cd3c

Proof format used by the proof-generating procedures. It is fairly close to Coq 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.

Sourcetype prf_rule =

Sourcetype proof =

Sourceval pr_size : prf_rule -> NumCompat.Q.t

Sourceval pr_rule_max_def : prf_rule -> int

Sourceval pr_rule_max_hyp : prf_rule -> int

Sourceval proof_max_def : proof -> int

Sourceval normalise_proof : int -> proof -> int * proof

Sourceval output_prf_rule : Stdlib.out_channel -> prf_rule -> unit

Sourceval output_proof : Stdlib.out_channel -> proof -> unit

Sourceval add_proof : prf_rule -> prf_rule -> prf_rule

Sourceval mul_cst_proof : NumCompat.Q.t -> prf_rule -> prf_rule

Sourceval mul_proof : prf_rule -> prf_rule -> prf_rule

Sourceval compile_proof : int list -> proof -> Micromega.zArithProof

val cmpl_prf_rule : 
  ('a Micromega.pExpr -> 'a Micromega.pol) ->
  (NumCompat.Q.t -> 'a) ->
  prf_rule list ->
  prf_rule ->
  'a Micromega.psatz

Sourceval proof_of_farkas : prf_rule Mutils.IMap.t -> Vect.t -> prf_rule

Sourceval eval_prf_rule : (int -> LinPoly.t * op) -> prf_rule -> LinPoly.t * op

Sourceval eval_proof : (LinPoly.t * op) Mutils.IMap.t -> proof -> bool

Sourceval simplify_proof : proof -> proof * Mutils.ISet.t

Sourcemodule PrfRuleMap : Stdlib.Map.S with type key = prf_rule