diagrams / dual-treeLinks
Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.
☆16Updated 4 months ago
Alternatives and similar repositories for dual-tree
Users that are interested in dual-tree are comparing it to the libraries listed below
Sorting:
- ☆24Updated last month
- Benchmarks for numbers: ints, doubles, bignums, rationals, etc.☆20Updated 8 years ago
- Flush system metrics to statsd☆26Updated 5 months ago
- Non-empty Vectors☆26Updated 5 months ago
- A Haskell client library for Cayley database graph☆14Updated 5 months ago
- Simplify and render Template Haskell☆18Updated 7 years ago
- ☆23Updated last year
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Updated 8 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆19Updated 8 years ago
- A text editor zipper libary☆17Updated 10 months ago
- Criterion benchmarks for the different haskell concurrent channel implementations in base and stm☆17Updated 11 years ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 7 years ago
- Run lifted IO operations asynchronously and wait for their results☆29Updated last month
- High level, generic library for interrogative user interfaces in Haskell☆41Updated 4 years ago
- Accessing Postgres in a data frame in Haskell☆24Updated last year
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated 7 months ago
- Basic examples and functions for generics-sop☆19Updated last year
- Dynamically-typed Haskell expressions involving applications and variables.☆22Updated 8 months ago
- ST with efficient exceptions☆20Updated 8 years ago
- Simple comparative benchmarks for CSV parsing libraries☆17Updated 6 years ago
- Quasiquoter for LLVM☆31Updated 7 years ago
- Desugars Template Haskell abstract syntax to a simpler format without changing semantics☆20Updated last week
- A natural transformation package☆16Updated 7 months ago
- Get all your structure and rip it apart.☆32Updated 6 years ago
- Effectful Raw handler for Servant servers.☆16Updated 4 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆18Updated last month
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Deep evaluation of data structures☆43Updated 3 months ago
- Haskell98 indexed functors, monads, comonads☆25Updated 3 years ago
- Haskell library for efficiently building up buffers☆26Updated 9 months ago