gereeter / bounded-intmap
A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.
☆20Updated last year
Alternatives and similar repositories for bounded-intmap:
Users that are interested in bounded-intmap are comparing it to the libraries listed below
- ST with efficient exceptions☆20Updated 8 years ago
- There are many category theory implementations, but this one is mine☆16Updated 7 months ago
- Reasonable Haskell default import☆27Updated 2 years ago
- Override instances used by Haskell's generic derivation☆31Updated 2 years ago
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Updated 7 years ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- van Laarhoven Free Monad with Extensible Effects☆23Updated 9 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Library to integrate eta wai applications with servlet api☆18Updated 6 years ago
- An effect system similar to mtl with explicit dictionary passing.☆17Updated 6 years ago
- Automatic type class law checking.☆24Updated 3 months ago
- Efficient search weighted by an ordered monoid with monus.☆18Updated 2 years ago
- being a programming language for sequential circuits☆20Updated 5 months ago
- Manage Nix Haskell override sets☆11Updated 6 years ago
- freer-effects wrapper for persistent queries☆12Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Comment on Haskell documentation.☆13Updated 6 years ago
- United Monoids☆24Updated 2 years ago
- ☆11Updated 9 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 3 years ago
- Generate a cabal freeze file from a stack.yaml☆36Updated 6 years ago
- ScopeT and ScopeH☆13Updated 8 months ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 4 months ago
- An example of dynamically loading a Haskell source module☆18Updated 6 years ago
- Haskell library of row polymorphic record manipulator☆19Updated 4 years ago
- An experiment in functional interface design☆23Updated 8 years ago
- ☆14Updated 7 years ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago