Alternatives and similar repositories for stm-incremental:

Users that are interested in stm-incremental are comparing it to the libraries listed below

• byteverse / bytesmith
  Parse bytes fast
  ☆24Updated 9 months ago
• haskell-trasa / trasa
  Safe web routing in haskell
  ☆30Updated last year
• fumieval / oath
  Composable Concurrent Computation Done Right
  ☆30Updated 2 years ago
• phadej / overloaded
  Overloaded plugin
  ☆30Updated 8 months ago
• aaronallen8455 / Typson
  Type safe JSON PostgreSQL queries using bidirectional serializers
  ☆21Updated 4 years ago
• edwinb / IdrisApp
  An extensible IO-like monad-like thing for Idris, with support for including linear subprograms
  ☆22Updated 4 years ago
• ChrisPenner / catalyst
  There are many category theory implementations, but this one is mine
  ☆15Updated 5 months ago
• mwotton / roboservant
  generate contextually sensible fuzz tests for servant apps
  ☆26Updated 3 months ago
• ekmett / hkd
  higher-kinded data
  ☆30Updated last year
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 10 months ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• rampion / conkin
  Tools for functors from Hask^k to Hask
  ☆23Updated 5 years ago
• byteverse / json-syntax
  High-performance JSON parser
  ☆26Updated 9 months ago
• isovector / ldtk-types
  Types for ldtk
  ☆14Updated 10 months ago
• int-index / union
  Extensible type-safe unions for Haskell
  ☆33Updated 5 months ago
• mkloczko / derive-storable
  Deriving Storable instances using GHC.Generics
  ☆16Updated 2 years ago
• hanshoglund / iso-deriving
  Derive instances through isomorphisms
  ☆20Updated 8 months ago
• phadej / staged
  Staged Streams and other stuff
  ☆18Updated 2 years ago
• haskell-streaming / streaming-bytestring
  effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy
  ☆17Updated last week
• emilypi / nonempty-vector
  Non-empty Vectors
  ☆24Updated last month
• 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 last week
• byteverse / chronos
  Haskell time library focusing on performance
  ☆57Updated 2 months ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• emilypi / order
  Order theory
  ☆24Updated last year
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 4 years ago
• phadej / kleene
  Kleene algebra, regular expressions
  ☆32Updated last year
• agentultra / DataVersion
  ☆20Updated 2 years ago
• Gabriella439 / managed
  A monad for managed values
  ☆50Updated 2 years ago
• clash-lang / ghc-typelits-extra
  Extra type-level operations on GHC.TypeLits.Nat and a custom solver
  ☆16Updated 2 months ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated 10 months ago