robdockins / edison
Edison: A Library of Efficient Data Structures
☆55Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for edison
- playground for working with succinct data structures☆94Updated 9 years ago
- Clojure-style transients for Haskell☆32Updated 2 years ago
- ICFP 2019 preprints/papers☆44Updated 5 years ago
- complexity testing for haskell☆47Updated 8 years ago
- ☆40Updated 6 years ago
- The LVish Haskell library☆81Updated 2 years ago
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆68Updated 9 years ago
- Efficient implementation of the implicit treap data structure☆63Updated 3 years ago
- A hip inductive theorem prover!☆88Updated 3 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆102Updated 3 weeks ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆44Updated 5 months ago
- Dive into GHC☆82Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Accepted papers for ICFP 2015☆45Updated 8 years ago
- Hedgehog will eat your typeclass bugs☆56Updated 2 months ago
- JVM implementation in Haskell☆44Updated 2 months ago
- Haskell distributed parallel Haskell☆38Updated 7 years ago
- ☆41Updated 7 years ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆41Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- A type-checker for Haskell with integer constraints☆40Updated 9 years ago
- Static blog generator in Idris.☆39Updated 9 years ago
- A Haskell implementation of crit-bit trees.☆138Updated 2 years ago