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.15.1.tar.gz

sha256=513e953b7183d478acb75fd6e80e4dc32ac1a918cf4343ac31a859cfb4e9aad2

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