Certified programming with dependent types: a pragmatic introduction to the Coq proof assistant
The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for w...
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge, MA
The MIT Press
[2013]
|
Schlagwörter: | |
Links: | https://doi.org/10.7551/mitpress/9153.001.0001?locatt=mode:legacy |
Zusammenfassung: | The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online. |
Umfang: | 1 Online-Ressource (xii, 424 Seiten) |
ISBN: | 0262317869 0262317877 9780262317863 9780262317870 |
Internformat
MARC
LEADER | 00000cam a2200000Ki 4500 | ||
---|---|---|---|
001 | ZDB-260-MPOB-9153 | ||
003 | MaCbMITP | ||
005 | 20190503073418.0 | ||
006 | m o d | ||
007 | cr ||||||||||| | ||
008 | 140309s2013 mau ob 001 0 eng d | ||
020 | |a 0262317869 | ||
020 | |a 0262317877 | ||
020 | |a 9780262317863 | ||
020 | |a 9780262317870 | ||
024 | 3 | |a 9780262317870 | |
100 | 1 | |a Chlipala, Adam |d 1981- | |
245 | 1 | 0 | |a Certified programming with dependent types |b a pragmatic introduction to the Coq proof assistant |c Adam Chlipala |
264 | 1 | |a Cambridge, MA |b The MIT Press |c [2013] | |
264 | 4 | |c ©2013 | |
300 | |a 1 Online-Ressource (xii, 424 Seiten) | ||
336 | |b txt | ||
337 | |b c | ||
338 | |b cr | ||
520 | 8 | |a The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online. | |
630 | 0 | 0 | |a Coq (Electronic resource) |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 0262026651 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780262026659 |
966 | 4 | 0 | |l DE-91 |p ZDB-260-MPOB |q TUM_PDA_MPOB |3 MIT Press |u https://doi.org/10.7551/mitpress/9153.001.0001?locatt=mode:legacy |3 Volltext |
912 | |a ZDB-260-MPOB | ||
912 | |a ZDB-260-MPOB | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-260-MPOB-9153 |
---|---|
_version_ | 1821493840512548864 |
adam_text | |
any_adam_object | |
author | Chlipala, Adam 1981- |
author_facet | Chlipala, Adam 1981- |
author_role | |
author_sort | Chlipala, Adam 1981- |
author_variant | a c ac |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-260-MPOB |
format | eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02479cam a2200325Ki 4500</leader><controlfield tag="001">ZDB-260-MPOB-9153</controlfield><controlfield tag="003">MaCbMITP</controlfield><controlfield tag="005">20190503073418.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">140309s2013 mau ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262317869</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262317877</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262317863</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262317870</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780262317870</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chlipala, Adam</subfield><subfield code="d">1981-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Certified programming with dependent types</subfield><subfield code="b">a pragmatic introduction to the Coq proof assistant</subfield><subfield code="c">Adam Chlipala</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, MA</subfield><subfield code="b">The MIT Press</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 424 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1="8" ind2=" "><subfield code="a">The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online.</subfield></datafield><datafield tag="630" ind1="0" ind2="0"><subfield code="a">Coq (Electronic resource)</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">0262026651</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262026659</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-260-MPOB</subfield><subfield code="q">TUM_PDA_MPOB</subfield><subfield code="3">MIT Press</subfield><subfield code="u">https://doi.org/10.7551/mitpress/9153.001.0001?locatt=mode:legacy</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-260-MPOB-9153 |
illustrated | Not Illustrated |
indexdate | 2025-01-17T11:04:53Z |
institution | BVB |
isbn | 0262317869 0262317877 9780262317863 9780262317870 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (xii, 424 Seiten) |
psigel | ZDB-260-MPOB TUM_PDA_MPOB ZDB-260-MPOB |
publishDate | 2013 |
publishDateSearch | 2013 |
publishDateSort | 2013 |
publisher | The MIT Press |
record_format | marc |
spelling | Chlipala, Adam 1981- Certified programming with dependent types a pragmatic introduction to the Coq proof assistant Adam Chlipala Cambridge, MA The MIT Press [2013] ©2013 1 Online-Ressource (xii, 424 Seiten) txt c cr The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online. Coq (Electronic resource) Erscheint auch als Druck-Ausgabe 0262026651 Erscheint auch als Druck-Ausgabe 9780262026659 |
spellingShingle | Chlipala, Adam 1981- Certified programming with dependent types a pragmatic introduction to the Coq proof assistant Coq (Electronic resource) |
title | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant |
title_auth | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant |
title_exact_search | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant |
title_full | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant Adam Chlipala |
title_fullStr | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant Adam Chlipala |
title_full_unstemmed | Certified programming with dependent types a pragmatic introduction to the Coq proof assistant Adam Chlipala |
title_short | Certified programming with dependent types |
title_sort | certified programming with dependent types a pragmatic introduction to the coq proof assistant |
title_sub | a pragmatic introduction to the Coq proof assistant |
topic | Coq (Electronic resource) |
topic_facet | Coq (Electronic resource) |
work_keys_str_mv | AT chlipalaadam certifiedprogrammingwithdependenttypesapragmaticintroductiontothecoqproofassistant |