treeowl / sort-traversableLinks
Sort any Traversable container
☆41Updated 2 years ago
Alternatives and similar repositories for sort-traversable
Users that are interested in sort-traversable are comparing it to the libraries listed below
Sorting:
- Maps using values' monoidal structure during merging☆42Updated last month
- rewrite rules for type-level equalities☆62Updated last year
- A library for generic programming that aims to be easy to understand☆26Updated 2 months ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- van Laarhoven Free Monad with Extensible Effects☆23Updated 9 years ago
- Extensible type-safe unions for Haskell☆33Updated 2 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- ☆45Updated 3 years ago
- Tools for functors from Hask^k to Hask☆23Updated 5 years ago
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated last month
- There are many category theory implementations, but this one is mine☆16Updated 9 months ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated 9 months ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- ☆19Updated 4 months ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- Experimental tool to build reports on GHC build time for your projects.☆24Updated 2 years ago
- A single typeclass for Functor, Bifunctor, Trifunctor, etc.☆40Updated last year
- Cofun with Cofree Comonads☆32Updated 8 years ago
- Overloaded plugin☆30Updated 11 months ago
- Kleene algebra, regular expressions☆32Updated last year
- Demonstrating comonad transformers.☆37Updated 8 years ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- An experiment in functional interface design☆24Updated 8 years ago
- join and meet semilattices, lower and upper bounds.☆43Updated 7 months ago
- ☆35Updated 8 months ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Proposals for the Haskell Ecosystem☆51Updated 6 years ago
- ☆35Updated last year
- Efficient non-empty variants of containers data types, with full API☆26Updated last week
- Structured logging solution.☆35Updated 2 months ago