package coq-core

You can search for identifiers within the package.

in-package search v0.2.0

The Coq Proof Assistant -- Core Binaries and Tools

Install

Dune Dependency

coq.inria.fr Readme Edit opam file Versions (9)

Authors

T

The Coq development team, INRIA, CNRS, and contributors

Maintainers

T

The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.2.tar.gz

md5=5d1187d5e44ed0163f76fb12dabf012e

sha512=91bc81530fa4f6498961583ad51eac5001f139881788b88e360a866ad8e2a6e2c5bce86d1a580ab4cd4782bf49d48318767df82471ce33ba3ac143e5569ad33c

doc/micromega_plugin/Micromega_plugin/Polynomial/Poly/index.html

Module `Polynomial.Poly`Source

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

ai are rational constants (num type)
mi are monomials
c is a rational constant

Sourcetype t

Sourceval constant : NumCompat.Q.t -> t

constant c

returns
the constant polynomial c

Sourceval variable : var -> t

variable x

returns
the polynomial 1.x^1

Sourceval addition : t -> t -> t

addition p1 p2

returns
the polynomial p1+p2

Sourceval product : t -> t -> t

product p1 p2

returns
the polynomial p1*p2

Sourceval uminus : t -> t

uminus p

returns
the polynomial -p i.e product by -1

Sourceval get : Monomial.t -> t -> NumCompat.Q.t

get mi p

returns
the coefficient ai of the monomial mi.

Sourceval fold : (Monomial.t -> NumCompat.Q.t -> 'a -> 'a) -> t -> 'a -> 'a

fold f p a folds f over the monomials of p with non-zero coefficient

Sourceval add : Monomial.t -> NumCompat.Q.t -> t -> t

add m n p

returns
the polynomial n*m + p