oisdk / monus-weighted-searchLinks
Efficient search weighted by an ordered monoid with monus.
☆19Updated 3 years ago
Alternatives and similar repositories for monus-weighted-search
Users that are interested in monus-weighted-search are comparing it to the libraries listed below
Sorting:
- There are many category theory implementations, but this one is mine☆16Updated last year
- Sort any Traversable container☆42Updated 3 years ago
- Derive KnownNat constraints from other KnownNat constraints☆14Updated 2 months ago
- Staged Streams and other stuff☆19Updated 3 years ago
- ☆21Updated 3 years ago
- Icicle Streaming Query Language☆28Updated 2 months ago
- Uniform interface to reified data type information via Template Haskell☆20Updated this week
- higher-kinded data☆30Updated 2 years ago
- Composable Concurrent Computation Done Right☆30Updated 3 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated 2 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Override instances used by Haskell's generic derivation☆31Updated 3 years ago
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated last week
- Library and tool for parsing .eventlog files from GHC☆37Updated last week
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated last week
- A GHC plugin and library for analysing GHC Core☆54Updated 11 months ago
- Parse bytes fast☆25Updated last month
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Haskell library of row polymorphic record manipulator☆23Updated 5 years ago
- Maps using values' monoidal structure during merging☆42Updated 9 months ago
- Haskell Type Level Example Programs☆28Updated 8 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated last year
- Overloaded plugin☆31Updated last year
- Functions and newtype wrappers for traversing Trees☆30Updated last year
- Normalization by Evaluation for Embedded Domain-specific Languages☆31Updated last year
- Extensible type-safe unions for Haskell☆34Updated 9 months ago