Alternatives and similar repositories for astar-monad

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

• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated 3 weeks ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 2 years ago
• lehins / scheduler
  A work stealing scheduler
  ☆74Updated 7 months ago
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• hedgehogqa / haskell-hedgehog-classes
  Hedgehog will eat your typeclass bugs
  ☆56Updated 2 months ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last year
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• dhall-lang / dhall-to-cabal
  Compile Dhall expressions to Cabal files
  ☆101Updated 2 years ago
• kowainik / type-errors-pretty
  💄🐞 Combinators for writing pretty type errors easily
  ☆56Updated 3 years ago
• kowainik / membrain
  🧠 Type-safe memory units
  ☆61Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• isovector / type-errors
  tools for writing better type errors
  ☆73Updated last year
• ezyang / compact
  Compact regions library for Haskell
  ☆82Updated last year
• sellout / dada
  A total recursion scheme library for Dhall
  ☆66Updated last week
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆162Updated 3 weeks ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• polysemy-research / polysemy-zoo
  Experimental, user-contributed effects and interpreters for polysemy
  ☆72Updated 2 years ago
• sellout / caterwaul
  Wailing into the primordial ooze of category theory
  ☆55Updated last week
• kowainik / slist
  ♾️ Sized list
  ☆46Updated last year
• ocharles / what-it-do
  Automatically trace all (showable) binds in do expressions
  ☆84Updated 7 years ago
• matt-noonan / justified-containers
  Standard containers, with keys that carry type-level proofs of their own presence.
  ☆81Updated 5 years ago
• ndmitchell / spaceleak
  Notes on space leaks
  ☆102Updated 4 years ago
• ekmett / profunctors
  Haskell 98 Profunctors
  ☆70Updated 2 months ago
• willtim / recursion-schemes
  My London HUG talk: Recursion Schemes by Example
  ☆50Updated 11 years ago
• isovector / type-sets
  type level sets
  ☆67Updated 5 years ago
• nmattia / wai-lambda
  Haskell Webapps on AWS Lambda
  ☆43Updated 2 years ago
• kowainik / treap
  Efficient implementation of the implicit treap data structure
  ☆62Updated 4 years ago
• haskell-works / hw-json
  ☆50Updated 3 weeks ago
• dalaing / cofun
  Cofun with Cofree Comonads
  ☆32Updated 9 years ago
• target / row-types
  A Haskell library for open records and variants using closed type families and type literals
  ☆112Updated 3 years ago