theoremprover-museum / LCF77
The original Edinburgh LCF.
☆23Updated 8 years ago
Alternatives and similar repositories for LCF77:
Users that are interested in LCF77 are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 11 months ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- A zipper library for Racket☆20Updated 8 years ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- ☆12Updated 8 months ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 12 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Miller/pattern unification in Agda☆64Updated 11 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆17Updated 8 years ago
- Logic for story telling!☆34Updated 6 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆20Updated 10 years ago
- Type expanders (i.e. type-level functions) for Typed/Racket☆17Updated 3 years ago
- ☆11Updated 7 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- ☆15Updated 2 years ago