francoisschwarzentruber / prooffold
Another attempt for visualizing proofs
☆10Updated 2 months ago
Alternatives and similar repositories for prooffold:
Users that are interested in prooffold are comparing it to the libraries listed below
- A simple BDD library for OCaml☆13Updated 2 years ago
- First-order automated theorem prover based on the tableau method☆12Updated last month
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 2 months ago
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- A verified Implementation of a mini prolog☆14Updated 2 years ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆15Updated last month
- We aim to provide a composed build of all active Coq developments in existence☆12Updated last year
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆18Updated 4 years ago
- miniKanren with a first-order representation of the search space☆16Updated 5 months ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆10Updated this week
- A simple λProlog interpreter☆20Updated 3 years ago
- ☆9Updated 4 years ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated last month
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated last year
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Updated last year
- Formalisation of a capability machine and principles for reasoning about security properties☆19Updated this week
- A Coq library providing tactics to deal with hypothesis☆21Updated 3 weeks ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Page du cours preuves assistées par ordinateur 2021☆9Updated 9 months ago
- SIGPLAN website☆10Updated this week
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 2 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- A proof tree viewer that works with Coq through Proof General☆24Updated 3 years ago
- Multinomials for the Mathematical Components library.☆14Updated last month
- Algebraic Combinatorics in Coq☆38Updated last week
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆22Updated this week
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- TPTP linear logic version☆13Updated 4 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆35Updated last year