Alternatives and similar repositories for ghilbert:

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

• leanprover / tc
  Reference type checker for the Lean theorem prover
  ☆61Updated 8 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆78Updated 4 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆91Updated 7 years ago
• andrejbauer / marshall
  Real number computation software
  ☆123Updated 2 years ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆70Updated 3 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• HoTT / M-types
  A formalization of M-types in Agda
  ☆32Updated 5 years ago
• byorgey / species
  ☆17Updated last year
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 3 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 4 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 4 months ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆64Updated 11 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• simhu / cubical
  Implementation of Univalence in Cubical Sets
  ☆144Updated 9 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• imdea-software / htt
  Hoare Type Theory
  ☆73Updated 2 months ago
• andrejbauer / alg
  Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
  ☆83Updated 4 years ago
• rocq-archive / coq-in-coq
  A formalisation of the Calculus of Constructions
  ☆67Updated 7 months ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 4 months ago
• codedot / lambda
  Macro Lambda Calculus
  ☆47Updated 5 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• coq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆69Updated 2 weeks ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• clf / celf
  ☆59Updated 5 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆94Updated last month