SamuelSchlesinger / stm-incrementalLinks
A very simple interface for incremental computation using STM in Haskell.
☆13Updated 2 years ago
Alternatives and similar repositories for stm-incremental
Users that are interested in stm-incremental are comparing it to the libraries listed below
Sorting:
- Parse bytes fast☆24Updated last year
- generate contextually sensible fuzz tests for servant apps☆26Updated 6 months ago
- Type safe JSON PostgreSQL queries using bidirectional serializers☆21Updated 4 years ago
- Safe web routing in haskell☆30Updated 2 years ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- High-performance JSON parser☆26Updated last year
- There are many category theory implementations, but this one is mine☆16Updated 9 months ago
- Non-empty Vectors☆24Updated last month
- ☆20Updated 2 years ago
- Order theory☆24Updated last year
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- higher-kinded data☆30Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Tools for functors from Hask^k to Hask☆23Updated 5 years ago
- Clowns to the left of me, jokers to the right☆15Updated 5 years ago
- Overloaded plugin☆30Updated 11 months ago
- Staged Streams and other stuff☆18Updated 2 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Extensible type-safe unions for Haskell☆33Updated 2 months ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Updated 7 years ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 4 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 8 years ago
- Alternative and lite implementation of Hoogle☆11Updated last year
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆18Updated 3 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
- Uniform interface to reified data type information via Template Haskell☆21Updated 2 months ago
- Servant dhall bindings☆19Updated 4 years ago
- A text editor zipper libary☆17Updated 6 months ago
- The Event type, extracted from purescript-behaviors☆23Updated 4 years ago