Deducteam / zenon_modulo
First-order automated theorem prover based on the tableau method
☆15Updated 5 months ago
Alternatives and similar repositories for zenon_modulo
Users that are interested in zenon_modulo are comparing it to the libraries listed below
Sorting:
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 6 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Matita (proof assistant) with embedded elpi☆13Updated 7 years ago
- An ocaml implementation of conflict-driven reasoning☆14Updated 6 years ago
- A termination checker for higher-order rewriting with dependent types☆10Updated 4 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 3 months ago
- The opentheory tool processes higher order logic theory packages☆16Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated last month
- A constraint solver built from scratch in OCaml☆11Updated 3 years ago
- A repository of MetaOCaml packages☆12Updated last year
- The Zenon theorem prover☆15Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 2 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 7 months ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Owl's Differential Equation Solvers☆34Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Unofficial repository for the experimental porting of mathlib into lean4☆10Updated 4 years ago
- Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]☆14Updated last year
- Demystifying the magic of supertactics☆13Updated 3 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Updated 2 years ago
- TPTP linear logic version☆13Updated 3 months ago
- Coq library for serialization to S-expressions☆19Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- Prototype code for some Julia-OCaml bindings☆15Updated 4 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆24Updated last month
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆23Updated last month