Alternatives and similar repositories for gibbon

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

• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆260Updated 8 months ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆126Updated 2 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆140Updated last month
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆145Updated 3 weeks ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆116Updated 2 years ago
• RedPRL / cooltt
  😎TT
  ☆226Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last week
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆95Updated 3 months ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆209Updated 3 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆171Updated 3 weeks ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆80Updated 3 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆146Updated 3 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆126Updated 11 months ago
• ollef / rock
  Build system
  ☆123Updated last year
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆158Updated last month
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆138Updated 6 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆161Updated this week
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆265Updated 11 months ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆143Updated 4 years ago
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆147Updated last year
• stedolan / mlsub
  Prototype type inference engine
  ☆201Updated 3 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆188Updated 7 years ago