Alternatives and similar repositories for comonad

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

• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆164Updated last month
• mokus0 / monad-loops
  Some useful control operators for looping
  ☆47Updated 5 years ago
• ekmett / parsers
  Generic parser combinators
  ☆90Updated 11 months ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆83Updated last month
• haskellari / these
  An either-or-both data type, with corresponding hybrid error/writer monad transformer.
  ☆119Updated 8 months ago
• ekmett / distributive
  Dual Traversable
  ☆41Updated last month
• ekmett / semigroupoids
  ☆78Updated last month
• ekmett / contravariant
  Haskell 98 contravariant functors
  ☆73Updated last month
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆67Updated 3 months ago
• ekmett / reflection
  Reifies arbitrary Haskell terms into types that can be reflected back into terms
  ☆104Updated 11 months ago
• haskell-perf / dictionaries
  Benchmarks for dictionary data structures: hash tables, maps, tries, etc.
  ☆98Updated 4 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆82Updated 2 years ago
• agrafix / superrecord
  Haskell: Supercharged anonymous records
  ☆83Updated 3 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated 2 weeks ago
• rampion / constraint-unions
  A syntax for unions of constraints in Haskell
  ☆70Updated 8 years ago
• mgsloan / store
  Fast binary serialization in Haskell
  ☆110Updated last year
• ekmett / profunctors
  Haskell 98 Profunctors
  ☆70Updated 7 months ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆100Updated last year
• vincenthz / hs-gauge
  Lean Haskell Benchmarking
  ☆90Updated 3 years ago
• chrisdone-archive / labels
  Declare and access tuple fields with labels
  ☆59Updated 7 years ago
• ekmett / either
  the EitherT monad transformer
  ☆58Updated 4 months ago
• tonyday567 / numhask
  A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.
  ☆71Updated last month
• hedgehogqa / haskell-hedgehog-classes
  Hedgehog will eat your typeclass bugs
  ☆57Updated 8 months ago
• Gabriella439 / Haskell-Errors-Library
  Type-safe error handling
  ☆64Updated 2 years ago
• DanBurton / tardis
  ☆110Updated 3 weeks ago
• haskell / binary
  Efficient, pure binary serialisation using ByteStrings in Haskell.
  ☆116Updated last year
• commercialhaskell / describe
  Describe Haskell code in GHCi
  ☆72Updated 8 years ago
• HeinrichApfelmus / operational
  Implement monads by specifying instructions and their desired operational semantics.
  ☆84Updated last year
• tweag / linear-types
  Drafts, notes and resources for adding linear typing to GHC.
  ☆79Updated 5 years ago