Alternatives and similar repositories for idris-refined

Users that are interested in idris-refined are comparing it to the libraries listed below

• ekmett / profunctors
  Haskell 98 Profunctors
  ☆70Updated 6 months ago
• sellout / Iaia
  A recursion scheme library for Idris.
  ☆25Updated last month
• system-f / papa
  Reasonable Haskell default import
  ☆27Updated 3 years ago
• ekmett / contravariant
  Haskell 98 contravariant functors
  ☆73Updated this week
• ekmett / adjunctions
  Simple adjunctions
  ☆45Updated 3 months ago
• typelead / etlas
  Etlas, the build tool and package manager for the Eta programming language
  ☆63Updated 6 years ago
• ctford / flying-spaghetti-monster
  An Idris type provider for communicating type-checkable protocols.
  ☆26Updated 8 years ago
• japesinator / Idris-Profunctors
  A small profunctor library for idris
  ☆17Updated 3 years ago
• Soostone / retry
  Retry combinators for monadic actions that may fail
  ☆114Updated 2 years ago
• ekmett / distributive
  Dual Traversable
  ☆41Updated 2 years ago
• jameshaydon / smproc
  A well-typed symmetric-monoidal category of concurrent processes
  ☆25Updated 7 years ago
• typelead / eta-hackage
  A set of patches to make Hackage compatible with the Eta language.
  ☆64Updated 6 years ago
• mokus0 / monad-loops
  Some useful control operators for looping
  ☆47Updated 5 years ago
• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated last month
• dalaing / cofun
  Cofun with Cofree Comonads
  ☆32Updated 9 years ago
• ekmett / either
  the EitherT monad transformer
  ☆57Updated 2 months ago
• Blaisorblade / abt
  Implementing Abstract Binding Trees (in Scala, ...)
  ☆19Updated 9 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• winterland1989 / data-has
  Simple extensible product
  ☆36Updated 5 years ago
• cohomolo-gy / homotopy-type-theory-notes
  HoTT Note-taking action
  ☆25Updated 6 years ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆83Updated 3 months ago
• jdevuyst / dependable-data-structures
  Experiments in implementing functional data structures in Idris
  ☆15Updated 6 years ago
• tomjaguarpaw / product-profunctors
  ☆19Updated 5 months ago
• kowainik / slist
  ♾️ Sized list
  ☆47Updated last year
• idris-hackers / idris-free
  Free Monads and useful constructions to work with them
  ☆26Updated 7 years ago
• jaspervdj / psqueues
  Priority Search Queues in three different flavors for Haskell
  ☆67Updated last week
• gonzaw / extensible-records
  Extensible records for Idris
  ☆25Updated 4 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆164Updated 5 months ago
• goldfirere / effects
  A Haskell translation of Idris's original algebraic effects library
  ☆41Updated 9 years ago
• ekmett / zippers
  Zippers based on lenses and traversals
  ☆41Updated 2 years ago