Alternatives and similar repositories for HashedExpression

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

• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated 3 weeks ago
• frex-project / haskell-frex
  ☆23Updated last year
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 10 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 6 years ago
• GaloisInc / parameterized-utils
  A set of utilities for using indexed types including containers, equality, and comparison.
  ☆60Updated this week
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• sheaf / acts
  Haskell library for semigroup actions and torsors
  ☆62Updated 4 months ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆36Updated 2 years ago
• Magalame / fastest-matrices
  Benchmark of the main linear algebra libraries in Haskell
  ☆24Updated 5 years ago
• Gabriella439 / HasCal
  Haskell embedding of PlusCal
  ☆61Updated 3 years ago
• travitch / haggle
  An efficient graph library for Haskell
  ☆39Updated last week
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆46Updated last month
• frex-project / idris-frex
  ☆47Updated this week
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 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
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last month
• Bodigrim / bitvec
  Bit vectors: 8x less memory, up to 3500x faster than Vector Bool
  ☆72Updated last week
• con-kitty / categorifier
  Interpret Haskell programs into any cartesian closed category.
  ☆61Updated 2 weeks ago
• jdolson / hott-notes
  15-819 (Homotopy Type Theory) Lecture Notes
  ☆14Updated 7 years ago
• konsumlamm / rrb-vector
  An implementation of a Relaxed Radix Balanced Vector in Haskell.
  ☆26Updated 3 months ago
• haskell-perf / graphs
  ☆40Updated 5 years ago
• rampion / tree-traversals
  Functions and newtype wrappers for traversing Trees
  ☆30Updated 8 months ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• arrayfire / arrayfire-haskell
  Haskell bindings to ArrayFire
  ☆60Updated 5 months ago