Alternatives and similar repositories for hilbert:

Users that are interested in hilbert are comparing it to the libraries listed below

• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• jonsterling / tt
  secret project
  ☆17Updated 7 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 13 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 4 months ago
• lindig / lipsum
  A Literate Programming Tool inspired by NoWeb, implemented in OCaml
  ☆35Updated 6 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• Deducteam / SizeChangeTool
  A termination checker for higher-order rewriting with dependent types
  ☆10Updated 4 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 10 months ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• grebenyukaa / cmm-compiler-backend
  Used libraries: llvm-general, llvm-general-pure - 3.4.2-1; llvm version: 3.4.2-1; Based on http://www.stephendiehl.com/llvm/ solution.
  ☆7Updated 9 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• ualib / ualib.github.io
  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
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• fsestini / tt-in-cubical
  Type Theory in Type Theory using Cubical Agda
  ☆12Updated 6 years ago
• idris-hackers / idris-algebra
  This is an attempt at painting as many bikesheds as possible with a typeclass hierarchy for idris reflecting "Algebra"
  ☆18Updated 6 years ago
• mmcco / verified-parser-example
  A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.
  ☆20Updated 10 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago