Cantitate/Preț
Produs

Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Constructions: Texts in Theoretical Computer Science. An EATCS Series

Autor Yves Bertot Cuvânt înainte de G. Huet Autor Pierre Castéran Cuvânt înainte de C. Paulin-Mohring
en Limba Engleză Paperback – 15 dec 2010
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 53746 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 15 dec 2010 53746 lei  6-8 săpt.
Hardback (1) 71254 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 14 mai 2004 71254 lei  6-8 săpt.

Din seria Texts in Theoretical Computer Science. An EATCS Series

Preț: 53746 lei

Preț vechi: 63231 lei
-15% Nou

Puncte Express: 806

Preț estimativ în valută:
10284 11206$ 8666£

Carte tipărită la comandă

Livrare economică 23 aprilie-07 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642058806
ISBN-10: 3642058809
Pagini: 500
Ilustrații: XXV, 472 p. 1 illus.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.69 kg
Ediția:Softcover reprint of hardcover 1st ed. 2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Graduate

Cuprins

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.

Recenzii

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)


Textul de pe ultima copertă

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.

Caracteristici

First book providing the theoretical foundations A broad spectrum of applications of the theorem proving system Coq Includes supplementary material: sn.pub/extras