liamoc / hilbert
An intensely interactive, graphical theorem prover based on natural deduction
☆29Updated 10 years ago
Alternatives and similar repositories for hilbert:
Users that are interested in hilbert are comparing it to the libraries listed below
- A simple implementation of linear type theory☆38Updated 7 years ago
- Experimental functional language☆17Updated 2 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- ☆21Updated 6 years ago
- secret project☆17Updated 7 years ago
- A Literate Programming Tool inspired by NoWeb, implemented in OCaml☆34Updated 6 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆30Updated 6 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- The Alms Programming Language☆44Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- An extended typed Lambda Calculus☆21Updated 7 months ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Type theory in type theory☆16Updated 13 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- ☆17Updated 6 years ago
- ☆16Updated last month
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago