Alternatives and similar repositories for challenge

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

• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆173Updated last month
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 4 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 6 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆74Updated 3 years ago
• nomeata / inspection-testing
  Inspection Testing for Haskell
  ☆189Updated last month
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 10 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆114Updated 3 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 6 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆126Updated last year
• grin-compiler / ghc-whole-program-compiler-project
  GHC Whole Program Compiler and External STG IR tooling
  ☆119Updated last month
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆195Updated last week
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆133Updated 2 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated 3 months ago
• effectfully-ou / sketches
  A Haskell blog
  ☆151Updated last month
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆103Updated 3 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆91Updated 7 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• j-mie6 / ParsleyHaskell
  Reimplementation of Parsley in Haskell, with improvements
  ☆60Updated last month
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆133Updated last year
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• Helium4Haskell / helium
  The Helium compiler, Helium-as-a-library, and the texthint interpreter
  ☆97Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago