travitch / haggleLinks
An efficient graph library for Haskell
☆39Updated last month
Alternatives and similar repositories for haggle
Users that are interested in haggle are comparing it to the libraries listed below
Sorting:
- An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.☆49Updated 5 months ago
- Refactorio is a tool with which you build and maintain software.☆19Updated last year
- Agda-style equational reasoning in Haskell☆53Updated 3 months ago
- ☆30Updated last week
- Lens interface for your filesystem☆22Updated 4 years ago
- 💧 Liquid Haskell integration for Cabal and Stack☆25Updated 6 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- Web front UI for interactive Haskell projects☆33Updated 5 years ago
- A monad for managed values☆50Updated 2 years ago
- Simple reflection of expressions☆33Updated 4 years ago
- Ties the knot on data structures that reference each other by unique keys☆47Updated 11 months ago
- Dependently-typed finite maps (partial dependent products)☆66Updated 5 months ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 3 weeks ago
- Deep evaluation of data structures☆41Updated 3 weeks ago
- Fine-grained lattice primitives for Haskell☆37Updated last week
- Reification of data structures using observable sharing☆29Updated 8 months ago
- Invertible parsing for S-expressions☆34Updated 3 months ago
- ☆26Updated 6 months ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Auto-parallelizing Pure Functional Language☆27Updated 6 years ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆56Updated last year
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 2 months ago
- GHC prof manipulation script☆32Updated last year
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- the dynabook but for haskell☆23Updated 5 years ago
- Derive instances through isomorphisms☆20Updated last year
- ☆16Updated 3 years ago
- Haskell implementation of ULIDs (Unique Lexicographically Sortable Identifiers)☆34Updated 5 months ago
- Ghosts of Departed Proofs☆60Updated 4 years ago