technicalguy / acs-category-theory-notes-2017
Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
☆13Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for acs-category-theory-notes-2017
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 3 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- ☆11Updated 4 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 years ago
- STLC-related snippets in Agda☆15Updated 11 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda formalisation of NbE for λ□☆17Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆26Updated 7 years ago
- Work in progress☆34Updated 4 months ago
- NbE course @ Chalmers☆28Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- ☆11Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month