Alternatives and similar repositories for deanie

Users that are interested in deanie are comparing it to the libraries listed below

• haskell-numerics / random-fu
  A suite of Haskell libraries for representing, manipulating, and sampling random variables
  ☆43Updated 2 years ago
• jonascarpay / convoluted
  Dependently typed convolutional neural networks
  ☆35Updated 8 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 6 months ago
• achirkin / easytensor
  Many-dimensional type-safe numeric ops
  ☆46Updated 3 years ago
• arrayfire / arrayfire-haskell
  Haskell bindings to ArrayFire
  ☆60Updated 10 months ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last month
• andriusstank / downhill
  ☆20Updated 2 years ago
• tonyday567 / numhask
  A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.
  ☆70Updated 2 months ago
• treeowl / sort-traversable
  Sort any Traversable container
  ☆41Updated 3 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆46Updated 5 months ago
• phadej / acme-kmett
  A collection of Edward Kmett's packages in a single repository
  ☆16Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆125Updated last year
• blamario / grampa
  Grammatical parsers - combinator library for parsing general context-free grammars
  ☆42Updated this week
• Lysxia / generic-random
  Generic random generators
  ☆81Updated 2 years ago
• dmwit / universe
  Classes for types where we know all the values
  ☆39Updated 9 months ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆25Updated 4 years ago
• glguy / generic-traverse
  Demonstration for how to build "traverse" using GHC.Generics efficiently
  ☆22Updated 7 years ago
• bgamari / ghc-dump
  A GHC plugin and library for analysing GHC Core
  ☆54Updated 8 months ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• o1lo01ol1o / diffhask
  DSL for forward and reverse mode automatic differentiation in Haskell. Port of DiffSharp.
  ☆28Updated 6 years ago
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 3 years ago
• well-typed / recover-rtti
  Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).
  ☆35Updated 3 months ago
• atzeus / CTRex
  Open records for Haskell
  ☆22Updated 8 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆58Updated 2 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated 3 months ago
• mstksg / backprop-learn
  Combinators and types for easily building trainable neural networks using the backprop library
  ☆34Updated 5 years ago
• evertedsphere / noether
  Highly polymorphic algebraic structures with custom deriving strategies
  ☆30Updated 3 years ago