package rocq-runtime

  1. Overview
  2. Docs
The Rocq Prover -- Core Binaries and Tools

Install 

dune-project
 Dependency

rocq-prover.org Readme Edit opam file Versions (6)

Authors

  1. T
    The Rocq development team, INRIA, CNRS, and contributors

Maintainers

  1. T
    The Rocq development team <rocq+rocq-development@discoursemail.com>

Sources

rocq-9.3.0.tar.gz
sha256=3f0fc283e8644394aa9c7a6e3995b6d9ebbe1e6dda712bf431f9c372dcef95ad

doc/micromega_plugin/Micromega_plugin/Polynomial/index.html

Module Micromega_plugin.PolynomialSource

Sourceval max_nb_cstr : int Stdlib.ref
Sourcetype var = int
Sourcemodule Monomial : sig ... end
Sourcemodule MonMap : sig ... end
Sourcemodule Poly : sig ... end

Representation of polonomial with rational coefficient. a1.m1 + ... + c where

Sourcetype cstr = {
  1. coeffs : Vect.t;
  2. op : op;
  3. cst : Micromega_core_plugin.NumCompat.Q.t;
}
Sourceand op =
  1. | Eq
  2. | Ge
  3. | Gt
Sourceval compare_op : op -> op -> int
Sourceval opAdd : op -> op -> op
Sourceval is_strict : cstr -> bool

is_strict c

  • returns

    whether the constraint is strict i.e. c.op = Gt

Sourceexception Strict
Sourcemodule LinPoly : sig ... end

Linear(ised) polynomials represented as a Vect.t i.e a sorted association list. The constant is the coefficient of the variable 0

Sourcemodule ProofFormat : sig ... end

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

Sourceval output_cstr : Stdlib.out_channel -> cstr -> unit
Sourcemodule WithProof : sig ... end

module WithProof constructs polynomials packed with the proof that their sign is correct.

Sourcemodule BoundWithProof : sig ... end