Alternatives and similar repositories for vitrea-prototype-1:

Users that are interested in vitrea-prototype-1 are comparing it to the libraries listed below

• sjoerdvisscher / proarrow
  Haskell library for doing category theory with a central role for profunctors
  ☆21Updated 3 weeks ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆20Updated 3 years ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆36Updated 2 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 2 years ago
• sellout / haskerwaul
  Category theory concepts in type classes and instances.
  ☆22Updated last month
• ChrisPenner / catalyst
  There are many category theory implementations, but this one is mine
  ☆16Updated 8 months ago
• gelisam / magic-typelevel-elem
  Demonstrating how to make type families faster using typechecker plugins
  ☆21Updated 4 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• sellout / dredd
  Automatic type class law checking.
  ☆24Updated 3 months ago
• ekmett / zippers
  Zippers based on lenses and traversals
  ☆39Updated last year
• ekmett / hkd
  higher-kinded data
  ☆30Updated last year
• leftaroundabout / Symbolic-math-HaTeX
  Convenient Haskell syntax for writing in LaTeX math expressions
  ☆28Updated last year
• mroman42 / vitrea
  Optics via the profunctor representation theorem
  ☆24Updated 4 months ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• rampion / conkin
  Tools for functors from Hask^k to Hask
  ☆23Updated 5 years ago
• int-index / union
  Extensible type-safe unions for Haskell
  ☆33Updated last month
• ekmett / adjunctions
  Simple adjunctions
  ☆45Updated last month
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 3 months ago
• TOTBWF / cubical-categories
  Category theory formalized in cubical agda
  ☆20Updated 5 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last year
• edwinb / IdrisApp
  An extensible IO-like monad-like thing for Idris, with support for including linear subprograms
  ☆22Updated 5 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 last month
• sheaf / if-instance
  GHC plugin to branch on whether a constraint is satisfied
  ☆33Updated 3 weeks ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated 2 months ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆43Updated 3 weeks ago
• treeowl / sort-traversable
  Sort any Traversable container
  ☆41Updated 2 years ago
• clash-lang / ghc-typelits-natnormalise
  Normalise GHC.TypeLits.Nat equations
  ☆43Updated last month
• bgamari / monoidal-containers
  Maps using values' monoidal structure during merging
  ☆42Updated 3 weeks ago