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.
adamc@267: adamc@267: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.
adamc@267: adamc@267:The final part of the book applies the earlier parts' tools to examples in programming languages and compilers.
adamc@267: adamc@267:Interested in beta testing this book in a course you're teaching? Please drop me a line!
adamc@39:Updated on November 16, 2009 with a version retargeted to Coq 8.2pl1. Last incremental update on December 30, 2009.
adamc@231: adamc@266: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.
adamc@266: adamc@266: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, 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.
adamc@267: adamc@267:I'm also not sure how much of the final part, on programming languages and compilers, belongs in this book. It might change significantly or go away.
adamc@39: