pa-ba / compdata
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
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Generic Programming using True Sums of Products☆163Updated 4 months ago
- Monad Transformers and Classes☆77Updated 5 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Extensional capabilities and deriving combinators☆215Updated 10 months ago
- Inspection Testing for Haskell☆176Updated 4 months ago
- 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
- Haskell library for simple, concise and fast generic operations.☆80Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- constraint level if statements☆116Updated 7 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 2 years ago
- Implement monads by specifying instructions and their desired operational semantics.☆83Updated 11 months ago
- A collection of Notes on GHC☆69Updated 6 years ago
- Benchmarks for sequence data structures: lists, vectors, etc.☆89Updated 3 years ago
- Extensible Effects: An Alternative to Monad Transformers☆174Updated 4 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 2 months ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago
- ☆100Updated last month
- ☆93Updated last year
- Fast and concise extensible effects☆108Updated last year
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated last year
- Generic parser combinators☆87Updated 2 months ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆97Updated 3 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 2 months ago