sellout / yayaLinks
Yet another yet another recursion scheme library in Haskell.
☆89Updated last week
Alternatives and similar repositories for yaya
Users that are interested in yaya are comparing it to the libraries listed below
Sorting:
- A total recursion scheme library for Dhall☆66Updated last month
- A smart A* search monad transformer which supports backtracking user-state!☆81Updated 4 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Hedgehog will eat your typeclass bugs☆56Updated 5 months ago
- Comparing Haskell effect systems for ergonomics and speed☆67Updated 4 years ago
- Dual Traversable☆41Updated 2 years ago
- Haskell library for semigroup actions and torsors☆64Updated 9 months ago
- Refined types☆57Updated 7 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆82Updated 5 years ago
- A work stealing scheduler☆75Updated 10 months ago
- First-class type families☆90Updated 2 weeks ago
- Wailing into the primordial ooze of category theory☆55Updated last month
- do-notation for Category and "Arrow without arr"☆62Updated 8 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Experimental, user-contributed effects and interpreters for polysemy☆72Updated 2 years ago
- Smash products, Wedge products, and other Pointed stuff☆35Updated 3 years ago
- Interpreter for GHC Haskell☆22Updated 6 years ago
- ☆93Updated last year
- rewrite rules for type-level equalities☆62Updated 2 months ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated last month
- Zippers based on lenses and traversals☆41Updated 2 years ago
- Get all your structure and rip it apart.☆32Updated 7 years ago
- high-powered optics in a small package☆53Updated last month
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Generic Programming using True Sums of Products☆164Updated 3 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago