Bibliographic Information

Interactive theorem proving and program development : Coq'Art: the calculus of inductive constructions

Yves Bertot, Pierre Castèran ; foreword by Gérard Huet and Christine Paulin-Mohring

(Texts in theoretical computer science, An EATCS series)

Springer, c2004

  • : pbk

Available at  / 34 libraries

Search this Book/Journal

Note

Includes index

Includes bibliographical references (p. [453]-457) and indexes

Description and Table of Contents

Description

A practical introduction to the development of proofs and certified programs using Coq. An invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.

Table of 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.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top