Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Interactive theorem proving and program development
Bertot Y., Casteran P., SpringerVerlag, 2004. Type: Book (9783540208549)
Date Reviewed: Feb 8 2005

To Coq or not to Coq? This impressive volume by Bertot and Castéran is a comprehensive introduction on the Coq system and its underlying theory. It presents an extensive and didactical overview of Gallina, Coq’s specification language, and Vernacular, its command language.

Coq was developed by teams that the authors were active parts of, over the past 30 or so years. It is presented as a powerful software environment that provides tools/tactics to construct proofs.

Based on Church’s &lgr;-calculus on the theoretical side, and the powerful objective Caml functional programming language, on the technical side, Coq is probably the most universal system in this problem area that one can now find; this must-have book is its tutorial. Using Coq to check programs against specifications, do proofs in higher-order logic, define our own formal systems and ask for proofs, is, to say the least, convenient.

The Coq v8 system (released in 2004) is a comfortable environment that embraces new advances in &lgr;-calculus and typing, called the calculus of inductive constructions, a variant of type theory.

The authors classify the 16 chapters into five groups: “The Calculus of Constructions” (chapters 2 through 5), “Inductive Constructions” (chapters 6 and 8), “Certified Programs and Extraction” (chapters 9 through 11), “Advanced Use” (chapters 12 through 15), and “Proof Automation” (chapters 7 and 16). The material is presented in an easy to follow fashion, and the authors provide all of the necessary background knowledge before attacking new ground. There is an abundance of examples, and problems to be solved by the reader. Some examples may look clumsy, and not too elegant at a first glance. That is done on purpose, apparently, as the mistakes made always underline a lesson to be remembered.

Two gurus in this problem domain, Gérard Huet and Christine Paulin-Mohring, provide a historic perspective on the development of Coq, and computational logic in general, in their lengthy introduction to this volume, which Springer published in its European Association for Theoretical Computer Science (EATCS) Series.

The bottom line is: yes to Coq, definitely. This is a great textbook.

Reviewer:  Goran Trajkovski Review #: CR130782 (0511-1214)
Bookmark and Share
  Featured Reviewer  
 
Proof Theory (F.4.1 ... )
 
 
Lambda Calculus And Related Systems (F.4.1 ... )
 
 
Deduction And Theorem Proving (I.2.3 )
 
 
Mathematical Logic (F.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Proof Theory": Date
On the strength of temporal proofs
Andréka H., Németi I., Sain I. Theoretical Computer Science 80(2): 125-151, 1991. Type: Article
Apr 1 1992
Completion for unification
Doggaz N., Kirchner C. (ed) Theoretical Computer Science 85(2): 231-251, 1991. Type: Article
Aug 1 1992
Proof normalization with nonstandard objects
Goto S. Theoretical Computer Science 85(2): 333-351, 1991. Type: Article
Aug 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy