fsieczkowski / System-T
Formalisation of Goedel's System T in Coq
☆15Updated 13 years ago
Alternatives and similar repositories for System-T:
Users that are interested in System-T are comparing it to the libraries listed below
- Formalization of Linear Logic☆10Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Reflection library for Coq☆12Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- ☆11Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Mtac in Agda☆28Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- ☆45Updated 5 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Work in progress☆34Updated 3 months 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 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year