theoremprover-museum / logic-theoristLinks
The sources of the first theorem prover.
☆63Updated 7 years ago
Alternatives and similar repositories for logic-theorist
Users that are interested in logic-theorist are comparing it to the libraries listed below
Sorting:
- A tutorial for DCG's in swi-Prolog☆35Updated 4 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- Boolean Constraint Solving in Prolog☆43Updated 7 months ago
- Source of metamath book☆48Updated last year
- ☆56Updated 2 months ago
- Jape, a configurable proof editor (best at natural deduction and sequent calculus)☆51Updated last year
- Prolog implementation of microKanren☆43Updated 10 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- The Mechanization of Standard ML☆73Updated 3 years ago
- Library classes for the Twelf Proof System☆22Updated 5 years ago
- Statements of famous theorems proven in Coq [maintainer=@jmadiot]☆60Updated 3 weeks ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆155Updated last year
- Fast, simplified WAM-based Prolog system☆23Updated 2 months ago
- Reimplementation of Doug Lenat's Automated Mathematician by Bruce Porter's group at the University of Texas at Austin☆57Updated 16 years ago
- The original Edinburgh LCF.☆33Updated 8 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated 10 months ago
- Random ideas about libraries for Prolog☆12Updated 8 years ago
- YAP Development release☆15Updated 4 years ago
- Constraint Logic Programming over Integers☆202Updated last year
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- ☆60Updated 6 years ago
- Learn Prolog Now LaTeX sources☆87Updated 2 years ago
- Extended DCG syntax for Prolog by Peter Van Roy☆21Updated 7 years ago
- Constraint Logic Programming over Finite Domains☆182Updated 5 years ago
- Tutorial for the CHR system☆16Updated 4 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆56Updated 10 years ago
- SPSC: A Small Positive Supercompiler☆38Updated last year
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- Automatically exported from code.google.com/p/full-maude☆16Updated last year
- CHR: Leuven Constraint Handling Rules☆26Updated 3 weeks ago