Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science EATCS

Seitenzahl:

469

Gewicht:

850 g

Erschienen bei:

Springer

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.

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. TOC:A Brief Overview.- Types and Expressions.- Propositions and Proofs.- Dependent Products.- Everyday Logic.- Inductive Data Types.- Tactics and Automation.- Inductive Predicates.- Functions and Their Specifications.- Extraction and Imperative Programming.- A Case Study.- The Module System.- Infinite Objects and Proofs.- Foundations of Inductive Types.- General Recursion.- Proof by Reflection.- Appendix.- Index.

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. TOC:A Brief Overview.- Types and Expressions.- Propositions and Proofs.- Dependent Products.- Everyday Logic.- Inductive Data Types.- Tactics and Automation.- Inductive Predicates.- Functions and Their Specifications.- Extraction and Imperative Programming.- A Case Study.- The Module System.- Infinite Objects and Proofs.- Foundations of Inductive Types.- General Recursion.- Proof by Reflection.- Appendix.- Index.

Portrait

Mehr über...

Mehr über:  Analysis, Mathematik / Informatik, Computer, Calculus, Typentheorie, Software Engineering, Mathematical Logic, Formal Languages, Program Verification, Theorem Proving, Inductive Types, Proof Construction, Computer Engineering, Programming - Software Development, Programming - Systems Analysis & Design, Computer. Programming - Software Development. Programming - Systems Analysis & Design. Computer Engineering Informatik

Mehr von: 

Yves Bertot, Pierre Castéran, Springer