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 4 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Compiler backend for generating Scheme code☆28Updated 3 weeks ago
- ☆18Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Staged Streams and other stuff☆19Updated 3 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- Formal specification of the Haskell Language Report☆29Updated last month
- rewrite rules for type-level equalities☆62Updated 3 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 weeks ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 months ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Interpret Haskell programs into any cartesian closed category.☆67Updated 2 weeks 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 week
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- ☆24Updated last week
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated last week
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Ghosts of Departed Proofs☆62Updated 5 years ago
- Existential type.☆37Updated last year
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Agda category theory library for denotational design☆54Updated last month
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated 2 weeks ago
- Type-safe WebAssembly eDSL in Haskell☆28Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago