pepeiborra / gc-benchmarks
Benchmarks using the non-moving incremental GHC garbage collector
☆22Updated 5 years ago
Alternatives and similar repositories for gc-benchmarks:
Users that are interested in gc-benchmarks are comparing it to the libraries listed below
- ☆20Updated 5 years ago
- Desugars Template Haskell abstract syntax to a simpler format without changing semantics☆20Updated 3 months ago
- A monad for managed values☆51Updated 2 years ago
- higher-kinded data☆30Updated last year
- High-resolution clock functions: monotonic, realtime, cputime.☆59Updated last year
- Structured logging solution.☆35Updated last year
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆17Updated last month
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Benchmarking Haskell extensible-effect libraries.☆34Updated 4 years ago
- Dual Traversable☆42Updated last year
- High-performance JSON parser☆26Updated 10 months ago
- Deep evaluation of data structures☆41Updated 6 months ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 6 years ago
- open union and open product types in Haskell☆32Updated 4 years ago
- Safe web routing in haskell☆30Updated last year
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 7 years ago
- Quasiquoter for LLVM☆31Updated 6 years ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- ☆23Updated 7 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 3 months ago
- Run lifted IO operations asynchronously and wait for their results☆28Updated 4 months ago
- Zippers based on lenses and traversals☆38Updated last year
- A collection of ready-to-use Prometheus Metrics to monitor your Haskell application☆13Updated 6 months ago
- Non-empty Vectors☆24Updated 2 months ago
- B+-tree implementation in Haskell☆27Updated 5 years ago
- ☆44Updated last week
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Lazy infinite compact streams with cache-friendly O(1) indexing and applications for memoization☆59Updated last month