# HG changeset patch # User Adam Chlipala # Date 1386948771 18000 # Node ID 2bd6b00f831f18971bb8442d06d28ba8fee90754 # Parent 136d4b84eb96c726a15320d134244400fbba0d99 Web site: book cover and links to buy diff -r 136d4b84eb96 -r 2bd6b00f831f staging/cover.jpg Binary file staging/cover.jpg has changed diff -r 136d4b84eb96 -r 2bd6b00f831f staging/index.html --- a/staging/index.html Thu Dec 05 15:51:33 2013 -0500 +++ b/staging/index.html Fri Dec 13 10:32:51 2013 -0500 @@ -7,18 +7,26 @@

Certified Programming with Dependent Types

Adam Chlipala

-
-

This is the web site for an in-progress textbook about practical engineering with the Coq proof assistant. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation.

+
+book cover + +

This is the web site for a textbook about practical engineering with the Coq proof assistant. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation.

I'm following an unusual philosophy in this book, so it may be of interest even to long-time Coq users. At the same time, I hope that it provides an easier introduction for newcomers, since short and automated proofs are the starting point, rather than an advanced topic.

-

Interested in beta testing this book in a course you're teaching? Please drop me a line!

+

Interested in using this book in a course you're teaching? Please drop me a line!

-

A traditional hardcopy version will appear from MIT Press Real Soon Now*.

+

A traditional hardcopy version is available from MIT Press, who have graciously agreed to allow distribution of free versions online indefinitely, minus the benefits of the Press' copy editing!

+ +

Buy a Copy in Print

+
-

Distribution Formats

+

Distribution Formats (free version)

-

Status

- -

Updated on November 16, 2009 with a version retargeted to Coq 8.2pl1, then again on January 14, 2011 to support Coq 8.3, and then again on March 29, 2012 to support Coq 8.4 beta. On August 25, 2011, I started passes through all chapters, with an eye toward getting ready both for my fall class and publication by MIT Press. I added bibliographic references and index entries, along with the usual tweaks and improvements. In late Summer 2012, the mode switched to final proofreading by others.

- -

The current version is effectively a beta release. It is intended to be consistent, self-contained, and useful, both for individual study and for introductory theorem-proving classes aimed at students with ML or Haskell experience and with basic familiarity with programming language theory.

- -

The main omissions have to do with some supporting resources that I didn't get around to implementing when I used this book for a course. Some suggested exercises are present (now only in a supplementary file), but only at points where I was looking to assign an exercise in the course. Some chapters are lacking the annotations used to build reduced versions of their source code, where some definitions and proofs have been elided; the course instructor can step through such a file, guiding class participants in filling in the omitted code.

+

Old versions

Previous versions included a final Part on programming language semantics in particular. I have decided to separate that part out. I plan to put it up as a supplementary resource eventually; for now it is simply removed. (It remains present in the Mercurial history.)