A proof that Coq typeclass resolution is Turing-complete
-
Updated
Apr 16, 2023 - Coq
Coq is a formal proof management system. It provides a formal language to write
mathematical definitions, executable algorithms and theorems together with an
environment for semi-interactive development of machine-checked proofs. Typical
applications include the certification of properties of programming languages,
the formalization of mathematics and teaching.
A proof that Coq typeclass resolution is Turing-complete
OCaml module of Nijn to generate coq scripts for checking termination proofs of higher-order rewriting systems.
A verification tool developed in Coq for analyzing cloud block storage
A GraphQL-like query language. Preliminary experiments.
Research to analyze theoretical principles of the Coq Proof Management System
Rounds and renders huge rational numbers to human-readable decimals.
Machine-checked proofs of secrecy and authentication using CCSA framework
Example project setup for Coq that supports git submodule dependencies
🐓 Coq plugin for ASDF version manager.
Coq Implementation of the (vis, ar) Specification Framework for Replicated Data Types
A formal specification and verification of Tree Sort algorithm in Coq
COQ. Certified Programming with Dependent Types by Adam Chlipala. Exercises from the book. Solutions.
Coq development of almost-full relations, including the Ramsey Theorem, useful for proving termination [maintainer=@palmskog]
Calvin Talks Types
Created by Gérard Pierre Huet, Thierry Coquand
Released 1989
Latest release 23 days ago