OCaml module of Nijn to generate coq scripts for checking termination proofs of higher-order rewriting systems.
-
Updated
Jul 7, 2025 - OCaml
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.
OCaml module of Nijn to generate coq scripts for checking termination proofs of higher-order rewriting systems.
Coq plugin for plain dependency extraction
Fun plugin to play with the Gallina AST.
Proofbox : 2022 A tool to serve smt solvers (and some other formal verification tools) jobs
An interpreter for an imperative language and a Hoare logic prover
Tools for working with Verified Software Units
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.
A simple first order logic theorem prover using tableaux
A experimental compiler from Kind (Core) to Coq
Translate Rust 🦀 LLBC code (generated by https://github.com/AeneasVerif/charon) to Coq 🐓
Pure Demand Operational Semantics
Coq plugin for printing term abstract syntax trees and their digests
Modification to Coq to record intermediate proof states encountered during a proof
Created by Gérard Pierre Huet, Thierry Coquand
Released 1989