theoremprover-museum / HOL88Links
The HOL System is an environment for interactive theorem proving in a higher-order logic. Its most outstanding feature is its high degree of programmability through the meta-language ML.
☆10Updated 8 years ago
Alternatives and similar repositories for HOL88
Users that are interested in HOL88 are comparing it to the libraries listed below
Sorting:
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 7 years ago
- The Mechanization of Standard ML☆73Updated 2 years ago
- A simple compiler from the lambda calculus to MIPS assembly☆20Updated 8 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- The original Edinburgh LCF.☆32Updated 8 years ago
- An algebra for Matrix Expressions written in Maude☆24Updated 12 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- MLWorks is a Standard ML compiler and development environment.☆181Updated 7 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- The Delphin Project☆10Updated 8 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- Reference sheet for the Coq language.☆15Updated 4 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Poplog☆21Updated 14 years ago
- This repository contains the Maude 2 interpreter source tree.☆43Updated 7 years ago
- An idris backend compiling to chez scheme☆47Updated 7 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- Automatically exported from code.google.com/p/full-maude☆16Updated last year
- software archaeology of reflective towers of interpreters☆16Updated last month
- The Aldor Programming Language☆34Updated 5 months ago
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆43Updated last year
- Racket bindings for Z3☆24Updated 6 years ago
- My Own Linear Lisp☆40Updated 6 years ago
- A compilation-friendly fexpr language. (Proof of concept.)☆23Updated 5 months ago
- The MLtonLibrary repository☆36Updated 2 years ago
- αProlog☆18Updated 2 years ago