LEADER 03531nam  2200625   450 
001 9910557461103321
005 20230125181957.0
024 3 $a9780262317870
035   $a(CKB)2670000000528186
035   $a(SSID)ssj0001453548
035   $a(PQKBManifestationID)11825445
035   $a(PQKBTitleCode)TC0001453548
035   $a(PQKBWorkID)11491666
035   $a(PQKB)10595659
035   $a(CaBNVSL)mat06712486
035   $a(IDAMS)0b00006481ff4d7a
035   $a(IEEE)6712486
035   $a(OCoLC)872996245$z(OCoLC)881288988
035   $a(OCoLC-P)872996245
035   $a(MaCbMITP)9153
035   $a(MiAaPQ)EBC5966536
035   $a(oapen)https://directory.doabooks.org/handle/20.500.12854/78523
035   $a(PPN)258830824
035   $a(EXLCZ)992670000000528186
100   $a20151229d2013      uy              
101 0 $aeng
135   $aur|n|||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aCertified programming with dependent types $ea pragmatic introduction to the Coq proof assistant /$fAdam Chlipala
210   $aCambridge$cThe MIT Press$d2013
210  1$aCambridge, Massachusetts :$cMIT Press,$d[2013]
210  2$a[Piscataqay, New Jersey] :$cIEEE Xplore,$d[2013]
215   $a1 PDF (xii, 424 pages)
225 1 $aThe MIT Press
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a0-262-02665-1 
311   $a0-262-31787-7 
320   $aIncludes bibliographical references (pages [413]-417) and index.
330   $aThe 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.
606   $aAutomatic theorem proving$xComputer programs
606   $aComputer programming
610   $aComputer programming / software engineering
615  0$aAutomatic theorem proving$xComputer programs.
615  0$aComputer programming.
676   $a005.1
700   $aChlipala$b Adam$f1981-$01207696
801  0$bCaBNVSL
801  1$bCaBNVSL
801  2$bCaBNVSL
906   $aBOOK
912   $a9910557461103321
996   $aCertified programming with dependent types$92786198
997   $aUNINA