|
Coq - Definition and Overview |
|
|
In automated theorem proving, Coq is a proof assistant which handles mathematical assertions, checks mechanically proofs of these assertions,
helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the Calculus of Inductive Constructions, a derivative of the Calculus of Constructions.
It was developed in France, in the LogiCal (http://logical.inria.fr/) project, jointly operated by INRIA, École Polytechnique, University Paris XI and CNRS (there was also formerly a group at École Normale Supérieure de Lyon). The team leaders are Pr Gilles Dowek and Pr Christine Paulin-Mohring. Coq is written in the Ocaml programming language.
Coq means "rooster" in French - and Thierry Coquand (along with Gérard Huet) developed the aforementioned Calculus of Constructions.
External links
|
Example Usage of Coq |
 |
bradfordcross: @psnively very need. I have been meaning to dig into Coq for a while now...alas, higher priorities... |
 |
ror5: #soupfilms Coq'coon |
 |
TyColbyPR: Coq Au Vin. Gotta love it. |
|
|