emilypi / order
Order theory
☆24Updated last year
Alternatives and similar repositories for order
Users that are interested in order are comparing it to the libraries listed below
Sorting:
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- Parse bytes fast☆24Updated last year
- There are many category theory implementations, but this one is mine☆16Updated 8 months ago
- Safe web routing in haskell☆30Updated 2 years ago
- Overloaded plugin☆30Updated 11 months ago
- A very simple interface for incremental computation using STM in Haskell.☆13Updated 2 years ago
- Type safe JSON PostgreSQL queries using bidirectional serializers☆21Updated 4 years ago
- Tools for functors from Hask^k to Hask☆23Updated 5 years ago
- Batteries-included structured logging library☆30Updated this week
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Extensible type-safe unions for Haskell☆33Updated 2 months ago
- generate contextually sensible fuzz tests for servant apps☆26Updated 6 months ago
- Demonstrating how to make type families faster using typechecker plugins☆21Updated 4 years ago
- Existential type.☆37Updated 4 months ago
- Maps using values' monoidal structure during merging☆42Updated last month
- rewrite rules for type-level equalities☆62Updated last year
- Surgery for generic data types☆25Updated 4 years ago
- Haskell counters that can be safely incremented from multiple threads☆19Updated 5 months ago
- Clean up the formatting of 'show' output☆21Updated last week
- GHC prof manipulation script☆32Updated last year
- Fine-grained lattice primitives for Haskell☆37Updated last week
- An efficient graph library for Haskell☆39Updated 9 months ago
- Efficient non-empty variants of containers data types, with full API☆26Updated 10 months ago
- ☆18Updated 4 years ago
- higher-kinded data☆30Updated 2 years ago
- Haskell time library focusing on performance☆57Updated 5 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 2 months ago
- Automatic type class law checking.☆24Updated 4 months ago
- Derive instances through isomorphisms☆20Updated 11 months ago
- Kleene algebra, regular expressions☆32Updated last year