UID:
almahu_9948621707402882
Format:
XXV, 472 p. 1 illus.
,
online resource.
Edition:
1st ed. 2004.
ISBN:
9783662079645
Series Statement:
Texts in Theoretical Computer Science. An EATCS Series,
Content:
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.
Note:
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.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783642058806
Additional Edition:
Printed edition: ISBN 9783540208549
Additional Edition:
Printed edition: ISBN 9783662079652
Language:
English
DOI:
10.1007/978-3-662-07964-5
URL:
https://doi.org/10.1007/978-3-662-07964-5
