michaelsproul / dblib-linearView external linksLinks
Formalisation of the linear lambda calculus in Coq
☆10Dec 2, 2018Updated 7 years ago
Alternatives and similar repositories for dblib-linear
Users that are interested in dblib-linear are comparing it to the libraries listed below
Sorting:
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- ☆13Nov 23, 2019Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Aug 21, 2025Updated 5 months ago
- ☆26Feb 7, 2017Updated 9 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Tactic for polynomial manipulations☆12Jan 29, 2026Updated 2 weeks ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- ☆18May 10, 2022Updated 3 years ago
- A program logic for concurrent randomized programs☆13Nov 9, 2018Updated 7 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Apr 29, 2021Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Intermediate Memory Model (IMM) and compilation correctness proofs for it☆29Feb 5, 2025Updated last year
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- ☆15Oct 24, 2017Updated 8 years ago
- Formalization of Linear Logic in Coq☆18Apr 7, 2025Updated 10 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago