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:
- Logical relations proof in Agda☆27Updated 10 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Reflection library for Coq☆12Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Where my everyday research happens☆53Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆11Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆27Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- ☆45Updated 6 years ago
- Agda programming with holes☆27Updated 4 years ago
- ☆31Updated 10 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 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
- Formalization of Linear Logic☆10Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago