Alternatives and similar repositories for grampa:

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

• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆41Updated last week
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆65Updated last week
• ChrisPenner / catalyst
  There are many category theory implementations, but this one is mine
  ☆15Updated 5 months ago
• reinerp / indexed
  Haskell98 indexed functors, monads, comonads
  ☆25Updated 2 years ago
• ekmett / distributive
  Dual Traversable
  ☆42Updated last year
• phadej / overloaded
  Overloaded plugin
  ☆30Updated 8 months ago
• SuperpowersCorp / refactorio
  Refactorio is a tool with which you build and maintain software.
  ☆19Updated 8 months ago
• pkamenarsky / knit
  Ties the knot on data structures that reference each other by unique keys
  ☆47Updated 6 months ago
• ekmett / hkd
  higher-kinded data
  ☆30Updated last year
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 10 months ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated 2 months 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 last week
• jonascarpay / convoluted
  Dependently typed convolutional neural networks
  ☆35Updated 7 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated last month
• blamario / monoid-subclasses
  Subclasses of Monoid with a solid theoretical foundation and practical purposes
  ☆33Updated last month
• jfischoff / are-mutable-references-in-haskell-fast
  Code to go along with the blog post "Are Mutable References in Haskell Fast?"
  ☆10Updated 7 years ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆36Updated 2 years ago
• rampion / conkin
  Tools for functors from Hask^k to Hask
  ☆23Updated 5 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 12 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆30Updated 5 years ago
• camfort / reprinter
  Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring
  ☆27Updated 3 years ago
• ekmett / parsnip
  ☆18Updated 3 years ago
• haskell-perf / graphs
  ☆40Updated 5 years ago
• grin-compiler / ghc-wpc
  GHC-WPC is an extended GHC that exports the STG and other IR (.modpak) for the compiled modules and linker metadata (.ghc_stgapp) at appl…
  ☆10Updated last year
• haskell-numerics / random-fu
  A suite of Haskell libraries for representing, manipulating, and sampling random variables
  ☆42Updated last year
• SamuelSchlesinger / gaia
  An experiment in functional interface design
  ☆23Updated 8 years ago
• goldfirere / effects
  A Haskell translation of Idris's original algebraic effects library
  ☆41Updated 8 years ago