matijapretnar / proofsLinks
A collection of mechanised proofs
☆19Updated 6 years ago
Alternatives and similar repositories for proofs
Users that are interested in proofs are comparing it to the libraries listed below
Sorting:
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- NbE course @ Chalmers☆28Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- System F in coq.☆19Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Where my everyday research happens☆56Updated this week
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Category theory and algebra☆27Updated 9 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- ☆10Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago