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:
- Symbol manipulation☆37Updated 2 years ago
- generate contextually sensible fuzz tests for servant apps☆26Updated last month
- Parse bytes fast☆25Updated this week
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 4 months ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- Safe web routing in haskell☆30Updated 2 years ago
- Benchmarking Haskell extensible-effect libraries.☆34Updated 5 years ago
- Overloaded plugin☆31Updated last year
- A GHC plugin and library for analysing GHC Core☆54Updated 9 months ago
- rewrite rules for type-level equalities☆62Updated 2 months ago
- Experiments using a bidirectional typesystem☆17Updated 3 years ago
- Types for ldtk☆16Updated last year
- Playing with Haskell effect systems☆13Updated 5 years ago
- Type safe JSON PostgreSQL queries using bidirectional serializers☆21Updated 4 years ago
- A simple tool for visualising differences in Criterion benchmark results☆14Updated 7 months ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 4 months ago
- A simple library I wrote to allow me to quickly and easily construct command line interfaces.☆28Updated 2 years ago
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Updated 8 years ago
- Kleene algebra, regular expressions☆33Updated 2 years ago
- Haskell time library focusing on performance☆59Updated last week
- High-performance JSON parser☆26Updated 4 months ago
- type level sets☆67Updated 6 years ago
- ☆21Updated 2 years ago
- Efficient parser combinators for Haskell☆39Updated 2 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Memory-efficient representation of Unicode text strings☆22Updated 6 months ago
- Omit fields for instance deriving☆37Updated 5 years ago
- An implementation of first-class pattern matches in Haskell.☆13Updated 5 years ago
- Funny little Haskell impl☆18Updated 5 years ago