sellout / compiling-anything-to-categoriesLinks
a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.
☆21Updated last year
Alternatives and similar repositories for compiling-anything-to-categories
Users that are interested in compiling-anything-to-categories are comparing it to the libraries listed below
Sorting:
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 2 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆18Updated 4 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- ☆29Updated 2 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- Paper and talk☆54Updated last year
- Staged Streams and other stuff☆18Updated 2 years ago
- Existential type.☆37Updated 5 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Extend GHC's type checker with user-defined rules, without writing a type checker plugin.☆18Updated 3 years ago
- A program for generating LaTeX TikZ code for string diagrams.☆18Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- There are many category theory implementations, but this one is mine☆16Updated 9 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
- Linear map categories in Agda☆5Updated 2 years ago
- Leightweight generalized parser combinators☆20Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Interpret Haskell programs into any cartesian closed category.☆61Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- A usable type system for call by push-value☆33Updated 5 years ago