Alternatives and similar repositories for klister:

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

• wilbowma / cur
  A less devious proof assistant
  ☆222Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆108Updated 2 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆196Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆170Updated 6 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 6 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆125Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆129Updated 4 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆204Updated 5 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆55Updated 8 months ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆79Updated last month
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆255Updated 4 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆122Updated 7 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆158Updated last month
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• stchang / macrotypes
  ☆136Updated 2 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆107Updated 2 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆119Updated this week
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 5 months ago
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆53Updated 2 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago