package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

Dune Dependency

coq.inria.fr Edit opam file Versions (38)

Authors

T

The Coq development team, INRIA, CNRS, and contributors.

Maintainers

C

coqdev@inria.fr

Sources

coq-8.14.1.tar.gz

sha256=3cbfc1e1a72b16d4744f5b64ede59586071e31d9c11c811a0372060727bfd9c3

doc/micromega_plugin/Micromega_plugin/Polynomial/index.html

Module `Micromega_plugin.Polynomial`Source

Sourcemodule Mc = Micromega

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 = {

coeffs : Vect.t;
op : op;
cst : NumCompat.Q.t;

}

Sourceand op =

| Eq
| Ge
| Gt

Sourceval eval_op : op -> NumCompat.Q.t -> NumCompat.Q.t -> bool

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 Coq format but a bit more liberal.

Sourceval output_cstr : Stdlib.out_channel -> cstr -> unit

Sourceval opMult : op -> op -> op

Sourcemodule WithProof : sig ... end

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

Sourcemodule BoundWithProof : sig ... end