Alternatives and similar repositories for monad-dijkstra

Users that are interested in monad-dijkstra are comparing it to the libraries listed below

• fumieval / oath
  Composable Concurrent Computation Done Right
  ☆30Updated 2 years ago
• ekmett / hkd
  higher-kinded data
  ☆30Updated 2 years ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated 3 weeks ago
• sjoerdvisscher / proarrow
  Haskell library for doing category theory with a central role for profunctors
  ☆21Updated last week
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• nomeata / haskell-rec-def
  APIs for more recursive definitions
  ☆19Updated 7 months ago
• brandonchinn178 / ghc-string-interpolation-prototypes
  ☆19Updated 3 weeks ago
• wenkokke / priority-sesh
  Session Types with Priority in Linear Haskell
  ☆26Updated 11 months ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last year
• aionescu / wasm-hs
  Type-safe WebAssembly eDSL in Haskell
  ☆26Updated 7 months ago
• gelisam / linear-examples
  Example uses of linear types
  ☆43Updated 4 years ago
• bgamari / ghc-dump
  A GHC plugin and library for analysing GHC Core
  ☆54Updated 3 months ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated 2 years ago
• ekmett / parsnip
  ☆18Updated 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 2 months ago
• noughtmare / gpc
  Leightweight generalized parser combinators
  ☆20Updated last year
• input-output-hk / nothunks
  ☆49Updated last month
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated last month
• oofp / Beseder
  Beseder: make impossible state transitions impossible
  ☆31Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• aspiwack / haskell-benign
  A library for benign effects in Haskell
  ☆20Updated last week
• haskellari / some
  Existential type.
  ☆37Updated 5 months ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• dnlkrgr / hsreduce
  Minimizing Haskell programs for easier debugging of GHC compiler crashes
  ☆22Updated 3 years ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• ChrisPenner / catalyst
  There are many category theory implementations, but this one is mine
  ☆16Updated 9 months ago
• augustss / orthotope
  ☆26Updated 4 months ago