liamoc / hilbertLinks
An intensely interactive, graphical theorem prover based on natural deduction
☆29Updated 11 years ago
Alternatives and similar repositories for hilbert
Users that are interested in hilbert are comparing it to the libraries listed below
Sorting:
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- TPTP linear logic version☆14Updated 8 months ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- secret project☆17Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 🧊 TeX-подібна система верстки наукових праць☆20Updated 6 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- ☆21Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- translations of a lambda abstraction to combinations of operators☆18Updated 6 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- ☆29Updated 10 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago