Alternatives and similar repositories for compdata

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

• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆162Updated 2 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• ekmett / hask
  Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)
  ☆161Updated 4 years ago
• tweag / capability
  Extensional capabilities and deriving combinators
  ☆219Updated last year
• nomeata / inspection-testing
  Inspection Testing for Haskell
  ☆189Updated last week
• matt-noonan / justified-containers
  Standard containers, with keys that carry type-level proofs of their own presence.
  ☆81Updated 5 years ago
• KingoftheHomeless / in-other-words
  A higher-order effect system where the sky's the limit
  ☆91Updated 3 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆82Updated last year
• target / row-types
  A Haskell library for open records and variants using closed type families and type literals
  ☆112Updated 3 years ago
• haskell-perf / sequences
  Benchmarks for sequence data structures: lists, vectors, etc.
  ☆90Updated 3 years ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• haskell-perf / dictionaries
  Benchmarks for dictionary data structures: hash tables, maps, tries, etc.
  ☆97Updated 3 years ago
• int-index / ether
  Monad Transformers and Classes
  ☆76Updated 6 years ago
• Lysxia / first-class-families
  First-class type families
  ☆88Updated last month
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• jcpetruzza / barbies
  ☆93Updated last year
• patrickt / recschemes
  Text and Haskell source for my blog series on recursion schemes.
  ☆45Updated 3 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆80Updated last week
• myuon / ghc-compiler-notes
  A collection of Notes on GHC
  ☆71Updated 6 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 8 months ago
• mikeizbicki / ifcxt
  constraint level if statements
  ☆117Updated 7 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• HeinrichApfelmus / operational
  Implement monads by specifying instructions and their desired operational semantics.
  ☆85Updated last year
• xnning / GHC-Core-Literature-Review
  Literature review of GHC's Core language, System FC
  ☆67Updated 7 years ago
• well-typed / visualize-cbn
  ☆99Updated 3 months ago
• NorfairKing / validity
  Validity and validity-based testing
  ☆161Updated 4 months ago
• aisamanra / haddock-cheatsheet
  ☆103Updated 4 years ago
• dorchard / effect-monad
  Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
  ☆99Updated 2 years ago
• ekmett / reflection
  Reifies arbitrary Haskell terms into types that can be reflected back into terms
  ☆103Updated 7 months ago