A dependently-typed proof language intended to make provably correct bare metal code possible for working software engineers.
-
Updated
Apr 1, 2024 - Coq
A dependently-typed proof language intended to make provably correct bare metal code possible for working software engineers.
A function definition package for Coq
Lecture notes for a short course on proving/programming in Coq via SSReflect.
An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
Work in progress. Attempt to prove semantic preservation (forward simulation) for a simple compiler.
Personal research notes
Towards richer dependent types for DOT
Formalized Mathematics
Coq course materials with my solutions
Code and examples based on the book 'Certified Programming with Dependent Types' (version: June 30, 2016) by Adam Chlipala.
Add a description, image, and links to the dependent-types topic page so that developers can more easily learn about it.
To associate your repository with the dependent-types topic, visit your repo's landing page and select "manage topics."