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
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- ☆45Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- Reflection library for Coq☆12Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- A collection of mechanised proofs☆19Updated 6 years ago
- Where my everyday research happens☆56Updated this week
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ☆11Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda programming with holes☆28Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- 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
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- System F in coq.☆19Updated 11 years ago