Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant

Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant

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

Publication date: 30 Jun 2016

ISBN-10: 0262026651

ISBN-13: 9780262026659

Paperback: 369 pages

Views: 1,873

Type: Textbook

Publisher: The MIT Press

License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Post time: 13 Nov 2016 08:00:00

Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant

Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant This textbook covers practical engineering with the Coq proof assistant. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation.
Tag(s): Formal Methods
Publication date: 30 Jun 2016
ISBN-10: 0262026651
ISBN-13: 9780262026659
Paperback: 369 pages
Views: 1,873
Document Type: Textbook
Publisher: The MIT Press
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Post time: 13 Nov 2016 08:00:00
Summary/Excerpts of (and not a substitute for) the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported:
You are free to:

Share — copy and redistribute the material in any medium or format

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click here to read the full license.
From the Book Description:
The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations.

The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online.

More Resources:




About The Author(s)


Adam Chlipala is an Associate Professor without Tenure of Computer Science in the Department of Electrical Engineering and Computer Science at MIT. His research interests are applied logic in development tools for software and hardware, design and implementation of programming languages, and design, implementation, and applications of interactive proof assistants.

 

Adam Chlipala

Adam Chlipala is an Associate Professor without Tenure of Computer Science in the Department of Electrical Engineering and Computer Science at MIT. His research interests are applied logic in development tools for software and hardware, design and implementation of programming languages, and design, implementation, and applications of interactive proof assistants.

 


Book Categories
Sponsors
Icons8, a free icon pack