TiarkRompf / rrbtreesLinks
RRB-Trees: Efficient Immutable Vectors
☆50Updated 12 years ago
Alternatives and similar repositories for rrbtrees
Users that are interested in rrbtrees are comparing it to the libraries listed below
Sorting:
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 6 years ago
- Implementation and benchmarking of Scala Vectors with relaxed radix balanced trees for more efficient concatenations☆55Updated 6 years ago
- A JVM bytecode assembler written in Haskell.☆36Updated 9 years ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- A recursion scheme library for Idris.☆25Updated last month
- Free Monads and useful constructions to work with them☆26Updated 6 years ago
- Levenshtein edit distance, packaged for ATS☆12Updated 3 years ago
- An Idris type provider for communicating type-checkable protocols.☆26Updated 7 years ago
- Extensible records for Idris☆25Updated 4 years ago
- A port of Apache Sparks to Haskell using distributed process☆33Updated 8 years ago
- Lambda syntax for Scala EDSLs☆27Updated last year
- dhall-scala is a Scala library for consuming dhall configuration files from Scala programming language.☆39Updated 6 years ago
- Provably correct implementation of insertion sort in Idris.☆31Updated 4 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- every day i'm truffling☆70Updated 4 years ago
- JVM code generation☆32Updated 6 years ago
- A purity and nullability analysis tool for Java.☆25Updated 6 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- an exploration of subtyping-based category theory in scala☆25Updated 14 years ago
- A small bifunctor library for idris☆21Updated 4 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆20Updated last year
- Talks on category-parametric programming.☆22Updated last year
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- ☆23Updated 10 years ago
- ☆92Updated 9 years ago
- a capability-based system☆40Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago