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☆16Updated 3 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- Simple Neural Network Examples in 8 lines APL☆32Updated 2 years ago
- ☆19Updated 8 years ago
- The Aldor Programming Language☆35Updated 6 months ago
- A faithful implementation of the Colossal Cave Adventure in Unlambda☆18Updated 5 years ago
- Boolean Constraint Solving in Prolog☆46Updated 8 months ago
- SECD microprocessor reimplementation in VHDL☆35Updated 5 years ago
- High-end Cryptographic Library☆44Updated 5 years ago
- Metacompiler library supporting incremental transformation based on reference attribute grammar controlled rewriting.☆31Updated 2 months ago
- Poplog☆21Updated 14 years ago
- My Own Linear Lisp☆41Updated 7 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- Kali is Kelsey and Rees's distributed Scheme implementation based on Scheme48☆38Updated 13 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- A C implementation of the Shen programming language☆70Updated 3 years ago
- Deposited packages of the homalg project☆16Updated 3 months ago
- ☆58Updated 11 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- Art of Prolog Code☆36Updated 5 years ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- A small language to demo turning an interpreter into a compiler☆11Updated 8 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- ☆43Updated last week
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Original Joy☆10Updated 8 months ago
- Port of Shen to run on top of Wasp Lisp☆25Updated 3 years ago
- MLWorks is a Standard ML compiler and development environment.☆181Updated 7 years ago