JLimperg / cats
Category Theory in Agda. Learning exercise, not for public consumption.
☆24Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for cats
- Where my everyday research happens☆53Updated 2 months ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Implementing grep in Agda☆32Updated 3 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 4 months ago
- Invertible parsing for S-expressions☆33Updated last month
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- ☆82Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago