Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
☆20Feb 22, 2020Updated 6 years ago
Alternatives and similar repositories for SmallStepNI
Users that are interested in SmallStepNI are comparing it to the libraries listed below
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 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
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- ☆11Nov 27, 2024Updated last year
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Oct 15, 2018Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- ☆10May 3, 2017Updated 8 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Synthetic Differential Geometry in Agda☆13Jan 14, 2015Updated 11 years ago
- A benchmark for C program verification☆17Feb 22, 2024Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated 10 months ago
- ☆16Dec 28, 2021Updated 4 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Jun 24, 2016Updated 9 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- An Emacs mode for working with Agda code in an Org-mode like fashion, more or less.☆20Nov 8, 2021Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- PL syntax macros.☆21Nov 30, 2025Updated 3 months ago
- A simulator for visualising the evolution of π-calculus terms☆42Jun 14, 2022Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Arthur's Formal Metatheory in Coq☆17Feb 6, 2026Updated 3 weeks ago