kevinsullivan / cs1113f16Links
CS1 through Type Theory
☆17Updated 9 years ago
Alternatives and similar repositories for cs1113f16
Users that are interested in cs1113f16 are comparing it to the libraries listed below
Sorting:
- ☆16Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- ☆48Updated 6 years ago
- ☆85Updated 8 years ago
- ☆31Updated 11 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Cryptographic Constructions in the Type Theory of Agda☆52Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago