michaelsproul / dblib-linear
Formalisation of the linear lambda calculus in Coq
☆10Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for dblib-linear
- Lenses in Coq☆16Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- ☆20Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- ☆18Updated 2 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- ☆17Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆29Updated 3 weeks ago
- ☆16Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Mtac in Agda☆28Updated 3 years ago
- ☆12Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆21Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆13Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago