kevinsullivan / cs1113f16
CS1 through Type Theory
☆16Updated 8 years ago
Alternatives and similar repositories for cs1113f16
Users that are interested in cs1113f16 are comparing it to the libraries listed below
Sorting:
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- ☆84Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Formal semantics in Agda.☆16Updated 9 years ago
- Observational Type Theory as an Agda library☆53Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- ☆46Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆31Updated 10 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated 3 weeks ago
- ☆23Updated 9 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- The Prettiest Printer☆34Updated last year
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago