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
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 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
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- ☆18Updated 2 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago