An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
-
Updated
Mar 17, 2023
An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
Cicada Language (solo version)
An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logtk, a supporting library for manipulating terms, formulas, clauses, etc.
Zero-Knowledge Proofs "for (not too much
Resolution theorem proving for predicate logic in pure Python.
Cicada Language
[research] A modular SMT solver in OCaml, based on mcSAT
A modular library for CDCL(T) SMT solvers, with [wip] proof generation.
Python Symbolic Information Theoretic Inequality Prover
Haskell interface to automated theorem provers
An implementation of a propositional logic resolution prover in Rust.
A neural parser for typelogical grammars based on Sinkhorn networks and Linear Logic Proof Nets.
A experimental prover written in Common Lisp, based on clause resolution and Knuth-Bendix completion algorithm.
Add a description, image, and links to the prover topic page so that developers can more easily learn about it.
To associate your repository with the prover topic, visit your repo's landing page and select "manage topics."