dorchard / effect-monadLinks
Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
☆99Updated 3 months ago
Alternatives and similar repositories for effect-monad
Users that are interested in effect-monad are comparing it to the libraries listed below
Sorting:
- Recursion schemes for Idris☆64Updated 7 years ago
- Generic Programming using True Sums of Products☆164Updated 3 weeks ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Updated 3 weeks ago
- HoTT Note-taking action☆25Updated 6 years ago
- A magic typeclass that just does it☆126Updated 3 years ago
- Yet another … yet another recursion scheme library for Haskell☆89Updated this week
- 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
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last week
- Benchmarks to compare Haskell streaming library performance☆107Updated 4 months ago
- Wailing into the primordial ooze of category theory☆55Updated 3 weeks ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 9 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆82Updated 5 years ago
- A total recursion scheme library for Dhall☆66Updated last month
- Haskell 98 Profunctors☆70Updated 7 months ago
- Extensible Effects: An Alternative to Monad Transformers☆175Updated 5 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Type-safe effectful state machines in Haskell☆96Updated 5 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- TParsec - Total Parser Combinators in Idris☆99Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- A smart A* search monad transformer which supports backtracking user-state!☆82Updated 4 years ago
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- Dual Traversable☆41Updated 3 weeks ago
- Dive into GHC☆82Updated 9 years ago
- Type-level well-kinded natural numbers.☆36Updated last year
- Memoization monad transformer☆30Updated last year
- A fast open-union type, suitable for 100+ contained alternatives.☆100Updated last year
- ☆110Updated 3 weeks ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago