matijapretnar / proofsLinks
A collection of mechanised proofs
☆19Updated 5 years ago
Alternatives and similar repositories for proofs
Users that are interested in proofs are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Mtac in Agda☆28Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 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 8 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago