well-typed / full-text-search
An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.
☆49Updated 2 months ago
Alternatives and similar repositories for full-text-search:
Users that are interested in full-text-search are comparing it to the libraries listed below
- Ghosts of Departed Proofs☆60Updated 4 years ago
- This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.☆48Updated 2 weeks ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- 💄🐞 Combinators for writing pretty type errors easily☆55Updated 3 years ago
- Generate a derivation of (old) Spago dependencies, and use them to install them into the directory structure used by Spago.☆43Updated 9 months ago
- Symbol manipulation☆36Updated last year
- Comma (and other) separated values☆77Updated last year
- An efficient graph library for Haskell☆39Updated 8 months ago
- Surgery for generic data types☆25Updated 4 years ago
- Get all your structure and rip it apart.☆31Updated 6 years ago
- GHC prof manipulation script☆32Updated last year
- Example uses of linear types☆43Updated 4 years ago
- Refactorio is a tool with which you build and maintain software.☆19Updated 10 months ago
- Haskell time library focusing on performance☆57Updated 4 months ago
- Bidirectional JSON serialization☆40Updated 4 years ago
- Asymptotically optimal Brodal/Okasaki heaps☆30Updated 4 months ago
- A Haskell monad transformer library for data validation☆36Updated last year
- High-performance JSON parser☆26Updated 11 months ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆56Updated last year
- Maps using values' monoidal structure during merging☆42Updated last week
- Tasty meal of Dhall☆66Updated last year
- ☆54Updated 6 years ago
- Serializable closures for distributed programming.☆64Updated last year
- Dual Traversable☆42Updated last year
- Beseder: make impossible state transitions impossible☆31Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated 11 months ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 4 months ago
- Dependently-typed finite maps (partial dependent products)☆65Updated 2 months ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 6 years ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 4 years ago