mstksg / mutableLinks
Automatic piecewise-mutable references for your types
☆42Updated 5 years ago
Alternatives and similar repositories for mutable
Users that are interested in mutable are comparing it to the libraries listed below
Sorting:
- rewrite rules for type-level equalities☆62Updated last month
- An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.☆49Updated 8 months ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 2 weeks ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- 👅 Parse Haskell Language Extensions☆48Updated 3 weeks ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆29Updated 7 months ago
- Haskell library for semigroup actions and torsors☆64Updated 8 months ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆42Updated last month
- Example uses of linear types☆43Updated 5 years ago
- ☆30Updated last week
- Haskell time library focusing on performance☆58Updated 2 months ago
- An efficient graph library for Haskell☆38Updated last month
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 months ago
- higher-kinded data☆30Updated 2 years ago
- type level sets☆67Updated 5 years ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Web front UI for interactive Haskell projects☆34Updated 5 years ago
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- Demonstrating how to make type families faster using typechecker plugins☆21Updated 4 years ago
- A structured concurrency library☆85Updated 7 months ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆76Updated last month
- Ties the knot on data structures that reference each other by unique keys☆47Updated last year
- GRIN backend for Idris☆50Updated 5 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated this week
- Fine-grained lattice primitives for Haskell☆37Updated 3 months ago
- Efficient parser combinators for Haskell☆39Updated last month