Alternatives and similar repositories for challenge:

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

• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated 3 weeks ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆156Updated 2 months ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 2 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆108Updated 2 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆124Updated last year
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆144Updated this week
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆182Updated this week
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• re-xyr / cleff
  Fast and concise extensible effects
  ☆108Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆124Updated last year
• grin-compiler / ghc-whole-program-compiler-project
  GHC Whole Program Compiler and External STG IR tooling
  ☆117Updated 3 months ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆79Updated 3 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆123Updated 9 months ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• goldfirere / singletons
  Fake dependent types in Haskell using singletons
  ☆290Updated this week
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆186Updated 7 years ago
• agda / agda-language-server
  Language Server for Agda
  ☆106Updated 2 months ago
• JeanHuguesdeRaigniac / effects-landscape
  Effects libraries in Haskell
  ☆71Updated last year
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆79Updated last month
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆205Updated 5 years ago
• effectfully-ou / sketches
  A Haskell blog
  ☆134Updated 8 months ago