There are 2 repositories under coq-formalization topic.
A formalization of category theory in the Coq proof assistant.
Formalization of C++ for verification purposes.
LVC verified compiler
Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the package span monoids, groups, rings, and fields and provides both axiom definitions for these structures and proofs of foundational results. The current package contains over 800 definitions and proofs.
A verified polyhedral scheduling validator in Coq.
Verimag Polyhedra Library
A library of formalized automaton algorithms
Formalization of temporal logic in Coq
Coq formalization of "Functional Pearls: α-conversion is easy" (Altenkirch, 2002).
Coq formalisation of a translation from (an) extensional type theory to (a) weak type theory
Lambda Calculi Formalizations in Coq using nested datatypes for a type-safe term representation
Coq implementations of and proofs of properties of typed-languages in Benjamin Pierce's Types and Programming Languages
Coq formalization of the Habanero programming model.
This respository contains the formalization of different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to different sorting algorithms.
Work based on http://www-sop.inria.fr/marelle/GeometricAlgebra/
Certified LambdaJS semantics and interpreter.
An experimental ontology language formalized in Coq with many semantics