technicalguy / acs-category-theory-notes-2017Links
Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
☆14Updated 7 years ago
Alternatives and similar repositories for acs-category-theory-notes-2017
Users that are interested in acs-category-theory-notes-2017 are comparing it to the libraries listed below
Sorting:
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- ☆19Updated 10 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- ☆16Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 5 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
- ☆10Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- ☆26Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆11Updated 4 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 years ago
- Machine-checked Agda formalization for the ILC project☆15Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago