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. We may earn a commission when you buy through links labeled 'Ad' on this page.
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
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 3 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Oct 15, 2018Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- ☆11Nov 27, 2024Updated last year
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- An Emacs mode for working with Agda code in an Org-mode like fashion, more or less.☆21Nov 8, 2021Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Wordpress hosting with auto-scaling - Free Trial • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- ☆10May 3, 2017Updated 8 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 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
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Mar 5, 2026Updated last month
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- ☆18May 10, 2022Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated last year
- A benchmark for C program verification☆17Feb 22, 2024Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Synthetic Differential Geometry in Agda☆13Jan 14, 2015Updated 11 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 5 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- A mechanisation of Wasm in Rocq☆116Mar 30, 2026Updated 2 weeks ago
- PL syntax macros.☆21Mar 30, 2026Updated 2 weeks ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 8 years ago
- Tutorial series introducing Agda to the people at BCAM☆27Nov 29, 2021Updated 4 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Intrinsic Verification of Formal Grammar Theory☆28Apr 8, 2026Updated last week