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:
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years 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
- being a thing I build on a Saturday☆28Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago