argent0 / haskell-ml-benchmarkLinks
Comparing Different Stochastic Gradien Descent implementations in Haskell against Python
☆10Updated 9 years ago
Alternatives and similar repositories for haskell-ml-benchmark
Users that are interested in haskell-ml-benchmark are comparing it to the libraries listed below
Sorting:
- Performance shootout of various trie implementations☆18Updated 6 years ago
- ☆21Updated 2 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Simplify and render Template Haskell☆18Updated 7 years ago
- Haskell space profiling toolset☆14Updated 6 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- fast clustering algorithms☆15Updated 6 years ago
- ghc-datasize is a tool to determine the size of Haskell data structures in GHC's memory☆17Updated last year
- Sift through Haskell code for analysis purposes☆18Updated 7 years ago
- Benchmarks for use with IntelLabs/flrc.☆10Updated 2 years ago
- Futuristic New Age Golden Test management☆15Updated 2 years ago
- Type-level assertion operators☆16Updated 7 years ago
- A GHC source plugin which detects opportunities to use coerce☆17Updated 7 years ago
- Dependently typed convolutional neural networks☆35Updated 8 years ago
- Folds for recursive types with GHC Generics☆28Updated 3 weeks ago
- Map and Set over contiguous memory☆22Updated 2 years ago
- A library for generic programming that aims to be easy to understand☆26Updated 5 months ago
- A text editor zipper libary☆17Updated 9 months ago
- Extensible type-safe unions for Haskell☆34Updated 5 months ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 6 years ago
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- Operation Vanguard: fixing a number of Haskell packages at once☆11Updated 6 years ago
- A lab for future Criterion features.☆28Updated 6 years ago
- Typesafe Off-Heap data structures for GHC Haskell☆14Updated 7 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- An applicative monad that batches commands for later more efficient execution☆27Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- ST with efficient exceptions☆20Updated 8 years ago
- Various type-aligned sequence data structures.☆21Updated 4 years ago
- Maps using values' monoidal structure during merging☆42Updated 4 months ago