Interactive Theorem Proving and Program Development

Coq’Art: The Calculus of Inductive Constructions

AvYves Bertot,Pierre Castéran

Häftad, Engelska, 2010

Del i serien Texts in Theoretical Computer Science. An EATCS Series

922 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 299 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2010-12-15
Mått:155 x 235 x 27 mm
Vikt:750 g
Format:Häftad
Språk:Engelska
Serie:Texts in Theoretical Computer Science. An EATCS Series
Antal sidor:472
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642058806

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik

Recensioner i media

From the reviews of the first edition: "This book serves as a Coq user manual, supporting both beginners and experts in the use of Coq and its underlying theory. ... Numerous exercises further enhance the utility as a learning aid. A supporting website provides downloadable source for all the examples and solutions to the exercises. As an introduction to Coq the book is self-contained ... . The book is also comprehensive ... . In summary, the book is an essential companion for every Coq user ... ." (Valentin F. Goranko, Zentralblatt MATH, Vol. 1069, 2005)

Innehållsförteckning

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.