Details

Subject(s)

• Mathematical logic [Browse]
• Software engineering [Browse]
• Architecture, Computer [Browse]
• Computer programming [Browse]
• Computer logic [Browse]

Author

• Castéran, Pierre [Browse]
• Castéran, Pierre [Browse]

• Castéran, Pierre [Browse]

Series

• Texts in Theoretical Computer Science. An EATCS Series, [More in this series]
• Texts in Theoretical Computer Science. An EATCS Series, 1862-4499 [More in this series]

Summary note

Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. It is based on a theory called the calculus of inductive constructions, a variant of type theory. This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. With its large collection of examples and exercises it is an invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.

Notes

Bibliographic Level Mode of Issuance: Monograph

Bibliographic references

Includes bibliographical references and index.

Language note

English

Contents

• 1 A Brief Overview
• 2 Types and Expressions
• 3 Propositions and Proofs
• 4 Dependent Products, or Pandora’s Box
• 5 Everyday Logic
• 6 Inductive Data Types
• 7 Tactics and Automation
• 8 Inductive Predicates
• 9* Functions and Their Specifications
• 10 * Extraction and Imperative Programming
• 11 * A Case Study
• 12 * The Module System
• 13 ** Infinite Objects and Proofs
• 14 ** Foundations of Inductive Types
• 15 * General Recursion
• 16 * Proof by Reflection
• Insertion Sort
• References
• Coq and Its Libraries
• Examples from the Book.

Show 17 more Contents items

ISBN

3-662-07964-X

Doi

• 10.1007/978-3-662-07964-5

Statement on language in description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...