package rocq-runtime

You can search for identifiers within the package.

in-package search v0.2.0

The Rocq Prover -- Core Binaries and Tools

Install

md5=8d522602d23e7a665631826dab9aa92b

sha512=f4f76a6a178e421c99ee7a331a2fd97a06e9c5d0168d7e60c44e3820d8e1a124370ea104ad90c7f87a9a1e9d87b2d0d7d2d387c998feeaed4a75ed04e176a4be

module Mc = Micromega_core_plugin.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

val q_cert_of_pos : 
  Micromega_core_plugin.Sos_types.positivstellensatz ->
  Mc.q Mc.psatz

q_cert_of_pos prf converts a Sos proof into a rational Rocq proof

val z_cert_of_pos : 
  Micromega_core_plugin.Sos_types.positivstellensatz ->
  Mc.z Mc.psatz

z_cert_of_pos prf converts a Sos proof into an integer Rocq 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.