sjoerdvisscher / proarrowLinks
Haskell library for doing category theory with a central role for profunctors
☆21Updated last 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
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Ghosts of Departed Proofs☆60Updated 4 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- Leightweight generalized parser combinators☆20Updated last year
- checkers for algebra driven design☆34Updated 2 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Where my everyday research happens☆53Updated last month
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Classes for types where we know all the values☆39Updated 6 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- Generic functions for single-sorted first-order structural unification☆45Updated 2 months ago
- Standard module for type-level programming in Haskell☆30Updated 6 years ago
- A single typeclass for Functor, Bifunctor, Trifunctor, etc.☆41Updated 2 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆29Updated 4 months ago
- higher-kinded data☆30Updated 2 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 4 months ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆15Updated last year
- ☆26Updated 6 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- NbE course @ Chalmers☆28Updated 9 months ago
- Normalise GHC.TypeLits.Nat equations☆43Updated 2 months ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year