ekmett / comonadLinks
Haskell 98 comonads
☆78Updated 9 months ago
Alternatives and similar repositories for comonad
Users that are interested in comonad are comparing it to the libraries listed below
Sorting:
- Generic Programming using True Sums of Products☆164Updated 4 months ago
- Generic parser combinators☆89Updated 9 months ago
- An either-or-both data type, with corresponding hybrid error/writer monad transformer.☆118Updated 6 months ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Some useful control operators for looping☆47Updated 5 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Updated 2 months ago
- Dual Traversable☆41Updated 2 years ago
- Haskell 98 contravariant functors☆73Updated last year
- ☆78Updated 2 months ago
- Fast binary serialization in Haskell☆110Updated 11 months ago
- Hedgehog will eat your typeclass bugs☆56Updated 6 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Efficient, pure binary serialisation using ByteStrings in Haskell.☆115Updated 10 months ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆98Updated 4 years ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 3 years ago
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- Haskell 98 Profunctors☆70Updated 5 months ago
- base library for GHCJS for JavaScript interaction and marshalling, used by higher level libraries like JSC☆46Updated 5 months ago
- 🧠 Type-safe memory units☆61Updated 5 years ago
- Describe Haskell code in GHCi☆72Updated 8 years ago
- Declare and access tuple fields with labels☆59Updated 6 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 9 months ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- A magic typeclass that just does it☆125Updated 3 years ago
- Lean Haskell Benchmarking☆90Updated 3 years ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆71Updated this week
- Recursion schemes for Idris☆64Updated 7 years ago
- Check properties on standard classes and data structures☆80Updated last month
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Dependently-typed finite maps (partial dependent products)☆66Updated last month