Certified implementation of a parametrized framework for concurrent garbage collectors
-
Updated
Dec 4, 2016 - Coq
Certified implementation of a parametrized framework for concurrent garbage collectors
Homeworks for 'formal languages and grammars' discipline
Formalization of a simple functional language with records and subtyping in Twelf.
Collaborative repo for Big Proof Programme at the Isaac Newton Institute, Jun 26 to Aug 4, 2017
Mechanized formalization of Implicit resolution in Agda
Formalising Type Theory in a modular way for translations between type theories
Coq formalization of the Habanero programming model.
Formalization of the polymorphic lambda calculus and its parametricity theorem
A formalization of SRPs and Control Plane Compression in Coq.
some sorting algorithms' formalisation
Formalization of Robin Milner's bigraphs in Isabelle/HOL
Formalized laws for mtl
Automatically push changes to selected repositories - 0% tested yet 100% correct.
Linear algebra formalization in Agda
Two-Level Type Theory
Specification, formalization and verification of the XC function from ex lambda calculus in Coq.
Formalization of some elementary mathematical theories in Coq
Complexity analysis, type safety, soundness, etc.
Add a description, image, and links to the formalization topic page so that developers can more easily learn about it.
To associate your repository with the formalization topic, visit your repo's landing page and select "manage topics."