matijapretnar / proofs
A collection of mechanised proofs
☆16Updated 4 years ago
Alternatives and similar repositories for proofs:
Users that are interested in proofs are comparing it to the libraries listed below
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆11Updated 4 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆12Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year