Alternatives and similar repositories for zm

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

• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• phadej / kleene
  Kleene algebra, regular expressions
  ☆33Updated last year
• Tritlo / ExampleHolePlugin
  ☆24Updated 5 years ago
• sheyll / newtype-zoo
  A Zoo of Haskell Newtype Wrappers
  ☆14Updated 4 years ago
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆66Updated 8 months ago
• iokasimov / apart
  Get all your structure and rip it apart.
  ☆32Updated 6 years ago
• adamConnerSax / knit-haskell
  Use Pandoc to write simple reports within haskell code. Inspired by R-markdown.
  ☆29Updated last month
• bgamari / monoidal-containers
  Maps using values' monoidal structure during merging
  ☆42Updated 6 months ago
• matt-noonan / gdp
  Ghosts of Departed Proofs
  ☆61Updated 4 years ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 3 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last month
• pkamenarsky / knit
  Ties the knot on data structures that reference each other by unique keys
  ☆47Updated last year
• obsidiansystems / dependent-sum
  Dependent sums and supporting typeclasses for comparing and displaying them
  ☆56Updated last year
• dmwit / universe
  Classes for types where we know all the values
  ☆39Updated 9 months ago
• haskell-trasa / trasa
  Safe web routing in haskell
  ☆30Updated 2 years ago
• agentultra / DataVersion
  ☆21Updated 2 years ago
• chrisdone-archive / webshow
  Show programming language printed values in a web UI
  ☆24Updated 6 years ago
• travitch / haggle
  An efficient graph library for Haskell
  ☆38Updated last month
• nobrakal / tungsten
  Bring fusion to everyone
  ☆14Updated 5 years ago
• jfischoff / are-mutable-references-in-haskell-fast
  Code to go along with the blog post "Are Mutable References in Haskell Fast?"
  ☆10Updated 8 years ago
• ku-fpg / data-reify
  Reification of data structures using observable sharing
  ☆29Updated 11 months ago
• mkloczko / derive-storable
  Deriving Storable instances using GHC.Generics
  ☆16Updated 3 years ago
• nfrisby / invariant-functors
  the 'invariant' Haskell package for invariant functors
  ☆16Updated 7 months ago
• haskell-numerics / random-fu
  A suite of Haskell libraries for representing, manipulating, and sampling random variables
  ☆43Updated 2 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• phadej / overloaded
  Overloaded plugin
  ☆30Updated last year
• yav / dump-core
  ☆45Updated 3 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated 3 months ago
• i-am-tom / dagless
  A monadic interface for DAG construction.
  ☆24Updated 4 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