sjoerdvisscher / proarrowLinks
Haskell library for doing category theory with a central role for profunctors
☆24Updated 2 weeks ago
Alternatives and similar repositories for proarrow
Users that are interested in proarrow are comparing it to the libraries listed below
Sorting:
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 4 months ago
- Haskell library for semigroup actions and torsors☆64Updated 10 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 5 months ago
- Ghosts of Departed Proofs☆62Updated 5 years ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 5 months ago
- Library of categories, with categorical constructions on them☆58Updated 2 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 6 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated last week
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- ☆50Updated 2 months ago
- Leightweight generalized parser combinators☆20Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- A really small example of the Backpack module system for Haskell☆59Updated last week
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- checkers for algebra driven design☆34Updated 3 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Classes for types where we know all the values☆39Updated 11 months ago
- Where my everyday research happens☆55Updated last month
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated 2 weeks ago
- Compiler backend for generating Scheme code☆28Updated 3 weeks ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 months ago
- First-class type families☆90Updated last month
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆15Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago