micromega_plugin
Polynomial.Poly
Representation of polonomial with rational coefficient. a1.m1 + ... + c where
btauto_plugin
cc_plugin
coq-core.boot
coq-core.clib
coq-core.config
coq-core.engine
coq-core.gramlib
coq-core.interp
coq-core.kernel
coq-core.lib
coq-core.library
coq-core.parsing
coq-core.plugins
coq-core.pretyping
coq-core.printing
coq-core.proofs
coq-core.stm
coq-core.sysinit
coq-core.tactics
coq-core.top_printers
coq-core.toplevel
coq-core.vernac
coq-core.vm
coqide-server.core
coqide-server.protocol
derive_plugin
extraction_plugin
firstorder_plugin
funind_plugin
ltac2_plugin
ltac_plugin
nsatz_plugin
number_string_notation_plugin
ring_plugin
rtauto_plugin
ssreflect_plugin
ssrmatching_plugin
tauto_plugin
tuto0_plugin
tuto1_plugin
tuto2_plugin
tuto3_plugin
zify_plugin
type t
val constant : NumCompat.Q.t -> t
constant c
the constant polynomial c
val variable : var -> t
variable x
the polynomial 1.x^1
val addition : t -> t -> t
addition p1 p2
the polynomial p1+p2
val product : t -> t -> t
product p1 p2
the polynomial p1*p2
val uminus : t -> t
uminus p
the polynomial -p i.e product by -1
val get : Monomial.t -> t -> NumCompat.Q.t
get mi p
the coefficient ai of the monomial mi.
val 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
fold f p a
val add : Monomial.t -> NumCompat.Q.t -> t -> t
add m n p
the polynomial n*m + p