Coq'Art is the familiar name for the first book on the Coq proof assistant and its underlying theory, the Calculus of Inductive Constructions. This project contains the Coq sources of all examples and the solution to 170 out of over 200 exercises from the book.
- Author(s):
- Yves Bertot (initial)
- Pierre Castéran (initial)
- Coq-community maintainer(s):
- License: MIT License
- Compatible Coq versions: 8.16 or later (use the corresponding release for other Coq versions)
- Additional dependencies: none
- Coq namespace:
coqart - Related publication(s):
git clone https://github.com/coq-community/coq-art
cd coq-art
make # or make -j <number-of-cores-on-your-machine>For more information, see the book website and the publisher's website. The repository is also used as the source for this website.
The repository is structured as follows.
- A Brief Presentation of Coq
- Gallina: Coq as a Programming Language
- Propositions and Proofs
- Dependent Product
- Everyday Logic
- Inductive Data Structures
- Tactics and automation
- Inductive Predicates
- Functions and their specification
- Extraction and imperative programming
- A Case Study: binary search trees
- The Module System
- Infinite Objects and Proofs
- Foundations of Inductive Types
- General Recursion
- Proof by reflection