sjoerdvisscher / proarrowLinks
Haskell library for doing category theory with a central role for profunctors
☆23Updated this week
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
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 2 months ago
- Haskell library for semigroup actions and torsors☆64Updated 8 months ago
- Ghosts of Departed Proofs☆61Updated 4 years ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- rewrite rules for type-level equalities☆62Updated last month
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 3 weeks ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Classes for types where we know all the values☆39Updated 9 months ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Fine-grained lattice primitives for Haskell☆37Updated 3 months ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆15Updated 2 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 months ago
- Library of categories, with categorical constructions on them☆58Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Leightweight generalized parser combinators☆20Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- First-class type families☆89Updated 2 weeks ago
- ☆10Updated 4 years ago
- A really small example of the Backpack module system for Haskell☆56Updated 9 months ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago