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

sha512=2f77bcb5211018b5d46320fd39fd34450eeb654aca44551b28bb50a2364398c4b34587630b6558db867ecfb63b246fd3e29dc2375f99967ff62bc002db9c3250

Sourcemodule Mc = Micromega

Sourcetype ('prf, 'model) res =

Sourcetype zres = (Mc.zArithProof, int * Mc.z list) res

Sourcetype qres = (Mc.q Mc.psatz, int * Mc.q list) res

Sourceval q_cert_of_pos : Sos_types.positivstellensatz -> Mc.q Mc.psatz

q_cert_of_pos prf converts a Sos proof into a rational Coq proof

Sourceval z_cert_of_pos : Sos_types.positivstellensatz -> Mc.z Mc.psatz

z_cert_of_pos prf converts a Sos proof into an integer Coq proof

Sourceval lia : int -> (Mc.z Mc.pExpr * Mc.op1) list -> zres

lia depth sys generates an unsat proof for the linear constraints in sys.

Sourceval nlia : int -> (Mc.z Mc.pExpr * Mc.op1) list -> zres

nlia depth sys generates an unsat proof for the non-linear constraints in sys. The solver is incomplete -- the problem is undecidable

Sourceval linear_prover_with_cert : int -> (Mc.q Mc.pExpr * Mc.op1) list -> qres

linear_prover_with_cert depth sys generates an unsat proof for the linear constraints in sys. Over the rationals, the solver is complete.

Sourceval nlinear_prover : int -> (Mc.q Mc.pExpr * Mc.op1) list -> qres

nlinear depth sys generates an unsat proof for the non-linear constraints in sys. The solver is incompete -- the problem is decidable.