sellout / yayaLinks
Yet another yet another recursion scheme library in Haskell.
☆89Updated last month
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 2 weeks ago
- A smart A* search monad transformer which supports backtracking user-state!☆81Updated 3 years ago
- A work stealing scheduler☆74Updated 7 months ago
- Wailing into the primordial ooze of category theory☆55Updated last week
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆81Updated 5 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Refined types☆57Updated 6 years ago
- Smash products, Wedge products, and other Pointed stuff☆35Updated 3 years ago
- Experimental, user-contributed effects and interpreters for polysemy☆72Updated 2 years ago
- tools for writing better type errors☆73Updated last year
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Dual Traversable☆42Updated 2 years ago
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- Hedgehog will eat your typeclass bugs☆56Updated 2 months ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- Generic Programming using True Sums of Products☆162Updated last month
- Haskell library for semigroup actions and torsors☆64Updated 6 months ago
- rewrite rules for type-level equalities