Alternatives and similar repositories for effect-monad

Users that are interested in effect-monad are comparing it to the libraries listed below

• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated last month
• ekmett / hask
  Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)
  ☆161Updated 4 years ago
• ekmett / profunctors
  Haskell 98 Profunctors
  ☆70Updated 6 months ago
• cohomolo-gy / homotopy-type-theory-notes
  HoTT Note-taking action
  ☆25Updated 6 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆164Updated this week
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆83Updated 3 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated last year
• nomeata / ghc-justdoit
  A magic typeclass that just does it
  ☆126Updated 3 years ago
• composewell / streaming-benchmarks
  Benchmarks to compare Haskell streaming library performance
  ☆107Updated 4 months ago
• mokus0 / monad-loops
  Some useful control operators for looping
  ☆47Updated 5 years ago
• konn / type-natural
  Type-level well-kinded natural numbers.
  ☆36Updated last year
• suhailshergill / extensible-effects
  Extensible Effects: An Alternative to Monad Transformers
  ☆175Updated 4 years ago
• ekmett / contravariant
  Haskell 98 contravariant functors
  ☆73Updated this week
• sellout / caterwaul
  Wailing into the primordial ooze of category theory
  ☆55Updated last month
• UnkindPartition / regex-applicative
  Regex-based parsing with an applicative interface
  ☆131Updated 4 years ago
• rampion / constraint-unions
  A syntax for unions of constraints in Haskell
  ☆70Updated 8 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆84Updated 4 years ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• ekmett / ersatz
  A monad for interfacing with external SAT solvers
  ☆65Updated 6 months ago
• fumieval / witherable
  Filter with effects
  ☆74Updated last year
• jcpetruzza / barbies
  ☆93Updated last year
• sellout / dada
  A total recursion scheme library for Dhall
  ☆66Updated 2 weeks ago
• ekmett / reflection
  Reifies arbitrary Haskell terms into types that can be reflected back into terms
  ☆104Updated 10 months ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆99Updated 2 years ago
• plaidfinch / ComonadSheet
  A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…
  ☆158Updated 4 years ago
• Gabriella439 / foldl
  Composable, streaming, and efficient left folds
  ☆168Updated 11 months ago
• ekmett / semigroupoids
  ☆78Updated this week
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 5 years ago
• ekmett / adjunctions
  Simple adjunctions
  ☆45Updated this week