relrod / ctLinks
My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.
☆14Updated 6 years ago
Alternatives and similar repositories for ct
Users that are interested in ct are comparing it to the libraries listed below
Sorting:
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Category theory and algebra☆26Updated 9 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Miscellaneous constructions on monoids☆24Updated 6 months ago
- 🧊 Інститут формальної математики☆35Updated 4 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Updated 7 years ago
- Porting of software foundations book to Agda☆39Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- A workshop on learning Agda with minimal prerequisites.☆85Updated 9 years ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- ☆84Updated 8 years ago
- ☆32Updated 7 years ago