pa-ba / compdataLinks
Haskell library implementing "Data Types a la Carte"
☆91Updated last year
Alternatives and similar repositories for compdata
Users that are interested in compdata are comparing it to the libraries listed below
Sorting:
- Generic Programming using True Sums of Products☆162Updated last week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Inspection Testing for Haskell☆177Updated last month
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆97Updated 3 years ago
- Benchmarks for sequence data structures: lists, vectors, etc.☆90Updated 3 years ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 3 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 6 months ago
- Monad Transformers and Classes☆76Updated 6 years ago
- Text and Haskell source for my blog series on recursion schemes.☆45Updated 3 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Tutorial for LiquidHaskell☆78Updated 10 months ago
- Extensional capabilities and deriving combinators☆218Updated last year
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- ☆93Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆80Updated last month
- Haskell library for simple, concise and fast generic operations.☆81Updated last year
- First-class type families☆88Updated 2 months ago
- ☆110Updated last month
- constraint level if statements☆117Updated 7 years ago
- Measure allocations of a Haskell functions/values☆97Updated 9 months ago
- Implement monads by specifying instructions and their desired operational semantics.☆84Updated last year
- ☆100Updated last month
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆103Updated 5 months ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆81Updated 5 years ago
- Validity and validity-based testing☆160Updated 2 months ago
- Generic parser combinators☆88Updated 5 months ago