Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
-
Updated
Feb 22, 2020 - Coq
Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
A Clojure implementation of the SIMPLE language as described in Understanding Computation by Tom Stuart. https://computationbook.com/
BOOL, BOOL++ and WHILE language implementations using Scala on different branches
Add a description, image, and links to the small-step-semantics topic page so that developers can more easily learn about it.
To associate your repository with the small-step-semantics topic, visit your repo's landing page and select "manage topics."