kowainik / treapLinks
Efficient implementation of the implicit treap data structure
☆62Updated 4 years ago
Alternatives and similar repositories for treap
Users that are interested in treap are comparing it to the libraries listed below
Sorting:
- Hedgehog will eat your typeclass bugs☆56Updated 2 months ago
- ♾️ Sized list☆46Updated last year
- Interpreter for GHC Haskell☆22Updated 5 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- 🧠 Type-safe memory units☆61Updated 4 years ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- Serializable closures for distributed programming.☆65Updated last year
- tools for writing better type errors☆73Updated last year
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago
- Evaluation-orthogonal serialisation of Haskell data, as a library☆62Updated 6 months ago
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 5 years ago
- Comma (and other) separated values☆78Updated last year
- An alternate definition of Haskell's Functor typeclass☆42Updated 6 years ago
- Evaluate special comments in your program on file save.☆38Updated 4 years ago
- A smart A* search monad transformer which supports backtracking user-state!☆81Updated 3 years ago
- Difference lists in Haskell☆65Updated last year
- Measure time complexity empirically.☆48Updated 9 years ago
- ☆40Updated 7 years ago
- Haskell library for semigroup actions and torsors☆62Updated 6 months ago
- rewrite rules for type-level equalities☆62Updated last year
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 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
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 4 months ago
- Content Addressable Storage Archive☆41Updated last year
- Template for Hindley-Milner based languages☆39Updated 3 years ago
- Get all your structure and rip it apart.☆32Updated 6 years ago
- ☆50Updated last week
- ☆45Updated 3 years ago