Alternatives and similar repositories for klister

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

• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆210Updated 5 years ago
• stchang / macrotypes
  ☆138Updated 3 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• wilbowma / cur
  A less devious proof assistant
  ☆226Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆199Updated 2 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated last month
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• Bodigrim / logict
  A continuation-based backtracking logic programming monad
  ☆92Updated 10 months ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆168Updated this week
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated last month
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆191Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• ollef / rock
  Build system
  ☆128Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 8 months ago
• Helium4Haskell / helium
  The Helium compiler, Helium-as-a-library, and the texthint interpreter
  ☆98Updated 10 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 7 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 months ago