matijapretnar / proofsLinks
A collection of mechanised proofs
☆17Updated 5 years ago
Alternatives and similar repositories for proofs
Users that are interested in proofs are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- System F in coq.☆19Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- ☆11Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆16Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ☆18Updated 3 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago