Alternatives and similar repositories for challenge

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

• grin-compiler / ghc-whole-program-compiler-project
  GHC Whole Program Compiler and External STG IR tooling
  ☆118Updated 9 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆166Updated 2 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆131Updated last year
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 2 weeks ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 7 months ago
• nomeata / inspection-testing
  Inspection Testing for Haskell
  ☆185Updated 2 months ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated last week
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 2 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆190Updated 8 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• j-mie6 / ParsleyHaskell
  Reimplementation of Parsley in Haskell, with improvements
  ☆56Updated last year
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆209Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• effectfully-ou / sketches
  A Haskell blog
  ☆148Updated last month
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 7 years ago
• re-xyr / cleff
  Fast and concise extensible effects
  ☆109Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆128Updated 2 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated last week
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆190Updated 3 weeks ago