diagrams / dual-tree
Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.
☆16Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for dual-tree
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆16Updated last month
- Effectful Raw handler for Servant servers.☆16Updated 3 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 5 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆16Updated 2 months ago
- ListT done right☆15Updated last year
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 7 years ago
- ST with efficient exceptions☆20Updated 8 years ago
- A very simple interface for incremental computation using STM in Haskell.☆13Updated last year
- Vector builder☆15Updated 11 months ago
- A text editor zipper libary☆17Updated last week
- A tutorial on writing a concurrency testing tool in Haskell