fsieczkowski / System-TLinks
Formalisation of Goedel's System T in Coq
☆15Updated 14 years ago
Alternatives and similar repositories for System-T
Users that are interested in System-T are comparing it to the libraries listed below
Sorting:
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Formalization of Linear Logic☆10Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Reflection library for Coq☆12Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- ☆45Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Library of Unix effects for Coq.☆22Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A small implementation of a proof refinement logic.☆50Updated 8 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 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Agda programming with holes☆27Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago