sjoerdvisscher / proarrowLinks
Haskell library for doing category theory with a central role for profunctors
☆24Updated 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
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Haskell library for semigroup actions and torsors☆64Updated last year
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- experimenting with unlifted classes via backpack☆37Updated 3 years ago
- Where my everyday research happens☆56Updated this week
- Leightweight generalized parser combinators☆20Updated 2 years ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 6 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 last month
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated 2 weeks ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated last week
- A virtual memory scanner☆10Updated 2 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆31Updated 11 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Distributors - Unifying Parsers, Printers & Grammars☆62Updated this week
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 5 months ago
- Classes for types where we know all the values☆39Updated last year
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- checkers for algebra driven design☆34Updated 3 years ago
- Library of categories, with categorical constructions on them☆59Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- Compiler backend for generating Scheme code☆28Updated 2 months ago