sjoerdvisscher / proarrowLinks
Haskell library for doing category theory with a central role for profunctors
☆23Updated 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
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 2 months ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Haskell library for semigroup actions and torsors☆64Updated 8 months ago
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Leightweight generalized parser combinators☆20Updated last year
- Where my everyday research happens☆55Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Library of categories, with categorical constructions on them☆57Updated 2 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated this week
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated last month
- classical sequent calculus, embedded in Haskell☆21Updated last month
- Session Types with Priority in Linear Haskell☆27Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 3 months ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated 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 2 months ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- ☆28Updated last month