ekmett / comonadLinks
Haskell 98 comonads
☆78Updated this week
Alternatives and similar repositories for comonad
Users that are interested in comonad are comparing it to the libraries listed below
Sorting:
- Haskell 98 contravariant functors☆73Updated this week
- Generic parser combinators☆89Updated 10 months ago
- An either-or-both data type, with corresponding hybrid error/writer monad transformer.☆119Updated 7 months ago
- Generic Programming using True Sums of Products☆164Updated last week
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Updated 3 months ago
- Some useful control operators for looping☆47Updated 5 years ago
- Dual Traversable☆41Updated last week
- ☆78Updated this week
- Declare and access tuple fields with labels☆59Updated 7 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Efficient, pure binary serialisation using ByteStrings in Haskell.☆115Updated 11 months ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 10 months ago
- A magic typeclass that just does it☆126Updated 3 years ago
- This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.☆50Updated this week
- Typed filepath☆127Updated 11 months ago
- Haskell 98 Profunctors☆70Updated 6 months ago
- the EitherT monad transformer☆57Updated 3 months ago
- Describe Haskell code in GHCi☆72Updated 8 years ago
- Fast binary serialization in Haskell☆110Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Check properties on standard classes and data structures☆80Updated 3 months ago
- Drafts, notes and resources for adding linear typing to GHC.☆79Updated 5 years ago
- Lean Haskell Benchmarking☆90Updated 3 years ago
- ☆89Updated last year
- Dependently-typed finite maps (partial dependent products)☆66Updated 2 months ago
- Filter with effects☆74Updated last year
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- All of `base` without the `Prelude` module☆44Updated 2 years ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆98Updated 4 years ago