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:
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- Boolean Constraint Solving in Prolog☆43Updated 7 months ago
- The HOL System is an environment for interactive theorem proving in a higher-order logic. Its most outstanding feature is its high degre…☆10Updated 8 years ago
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- Poplog☆21Updated 14 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Fast, simplified WAM-based Prolog system☆23Updated 2 months ago
- ☆19Updated 8 years ago
- Deposited packages of the homalg project☆15Updated 2 months ago
- The Aldor Programming Language☆34Updated 4 months ago
- My Own Linear Lisp☆40Updated 6 years ago
- Kali is Kelsey and Rees's distributed Scheme implementation based on Scheme48☆38Updated 13 years ago
- An Image Dictionary for Co-dfns☆14Updated 8 years ago
- adds an optional type system to J language☆21Updated 9 years ago
- An algebra for Matrix Expressions written in Maude☆24Updated 12 years ago
- A simple compiler from the lambda calculus to MIPS assembly☆20Updated 8 years ago
- Reason about Bitcoin addresses with Prolog☆22Updated last year
- CHR: Leuven Constraint Handling Rules☆26Updated 2 weeks ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago
- SECD microprocessor reimplementation in VHDL☆35Updated 5 years ago
- Simple Neural Network Examples in 8 lines APL☆31Updated 2 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆54Updated 8 years ago
- Art of Prolog Code☆36Updated 5 years ago
- Metacompiler library supporting incremental transformation based on reference attribute grammar controlled rewriting.☆31Updated last month
- ☆22Updated 5 years ago
- A WAM (Warren Abstract Machine for Prolog) written in Common Lisp☆13Updated 6 years ago
- A faithful implementation of the Colossal Cave Adventure in Unlambda☆17Updated 5 years ago
- Haskell User's Gofer System☆25Updated 9 years ago
- A scheme port of the Haskell code from "A Tutorial Implementation of a Dependently Typed Lambda Calculus"☆8Updated 11 years ago
- Prolog stuff☆28Updated 5 years ago