matijapretnar / proofs
A collection of mechanised proofs
☆16Updated 5 years ago
Alternatives and similar repositories for proofs:
Users that are interested in proofs are comparing it to the libraries listed below
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- ☆18Updated 2 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆11Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- ☆17Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 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
- Quasi-quoting library for agda☆17Updated 3 months ago
- ☆12Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago