theoremprover-museum / prover9Links
Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.
☆16Updated 7 years ago
Alternatives and similar repositories for prover9
Users that are interested in prover9 are comparing it to the libraries listed below
Sorting:
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 3 weeks ago
- Prove formulas of Presburger Arithmetic☆11Updated last year
- The Aldor Programming Language☆35Updated 8 months ago
- ☆19Updated 8 years ago
- My Own Linear Lisp☆42Updated 7 years ago
- Haskell User's Gofer System☆27Updated 9 years ago
- Simple Neural Network Examples in 8 lines APL☆32Updated 2 years ago
- Kali is Kelsey and Rees's distributed Scheme implementation based on Scheme48☆36Updated 13 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Automatically exported from code.google.com/p/full-maude☆16Updated last month
- This repository contains the Maude 2 interpreter source tree.☆43Updated 7 years ago
- High-end Cryptographic Library☆44Updated 5 years ago
- APL function editor written in APL☆12Updated 11 months ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- Cat's Eye Technologies' distribution of John Colagioia's Thue programming language☆29Updated 10 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- Poplog☆21Updated 14 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆54Updated 5 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Boolean Constraint Solving in Prolog☆48Updated 10 months ago
- A model checker for safe Petri nets based on partial-order semantics☆13Updated 4 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- MLWorks is a Standard ML compiler and development environment.☆181Updated 7 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- Reference sheet for the Coq language.☆15Updated 5 years ago
- ☆57Updated 8 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago