package coq-core

  1. Overview
  2. No Docs
The Coq Proof Assistant -- Core Binaries and Tools

Install 

dune-project
 Dependency

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

Authors

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

Maintainers

  1. T
    The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.1.tar.gz
md5=13d2793fc6413aac5168822313e4864e
sha512=ec8379df34ba6e72bcf0218c66fef248b0e4c5c436fb3f2d7dd83a2c5f349dd0874a67484fcf9c0df3e5d5937d7ae2b2a79274725595b4b0065a381f70769b42

doc/micromega_plugin/Micromega_plugin/Certificate/index.html

Module Micromega_plugin.CertificateSource

Sourcemodule Mc = Micromega
Sourcetype ('prf, 'model) res =
  1. | Prf of 'prf
  2. | Model of 'model
  3. | Unknown
Sourcetype zres = (Mc.zArithProof, int * Mc.z list) res
Sourcetype qres = (Mc.q Mc.psatz, int * Mc.q list) res

q_cert_of_pos prf converts a Sos proof into a rational Coq proof

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.