LEADER 05172nam  22008175  450 
001 9910145793603321
005 20200702124146.0
010   $a3-540-45949-9
024 7 $a10.1007/3-540-45949-9
035   $a(CKB)1000000000016884
035   $a(SSID)ssj0000324194
035   $a(PQKBManifestationID)11240630
035   $a(PQKBTitleCode)TC0000324194
035   $a(PQKBWorkID)10312705
035   $a(PQKB)10700928
035   $a(DE-He213)978-3-540-45949-1
035   $a(MiAaPQ)EBC3073201
035   $a(PPN)155181130
035   $a(EXLCZ)991000000000016884
100   $a20121227d2002      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aIsabelle/HOL $eA Proof Assistant for Higher-Order Logic /$fby Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
205   $a1st ed. 2002.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002.
215   $a1 online resource (XIV, 226 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2283
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-43376-7 
320   $aIncludes bibliographical references and index.
327   $aElementary Techniques -- 1. The Basics -- 2. Functional Programming in HOL -- 3. More Functional Programming -- 4. Presenting Theories -- Logic and Sets -- 5. The Rules of the Game -- 6. Sets, Functions, and Relations -- 7. Inductively Defined Sets -- Advanced Material -- 8. More about Types -- 9. Advanced Simplification, Recursion, and Induction -- 10. Case Study: Verifying a Security Protocol.
330   $aThis volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel?s proof script notation instead of ML tactic scripts. The l- ter make it easier to introduce new tactics on the ?y, but hardly anybody does that. Wenzel?s dedicated syntax is elegant, replacing for example eight simpli?cation tactics with a single method, namely simp, with associated - tions. The book has three parts. ? The ?rst part, Elementary Techniques, shows how to model functional programs in higher-order logic. Early examples involve lists and the natural numbers. Most proofs are two steps long, consisting of induction on a chosen variable followed by the auto tactic. But even this elementary part covers such advanced topics as nested and mutual recursion. ? The second part, Logic and Sets, presents a collection of lower-level tactics that you can use to apply rules selectively. It also describes I- belle/HOL?s treatment of sets, functions, and relations and explains how to de?ne sets inductively. One of the examples concerns the theory of model checking, and another is drawn from a classic textbook on formal languages.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2283
606   $aMathematical logic
606   $aLogic
606   $aComputers
606   $aArtificial intelligence
606   $aComputer logic
606   $aProgramming languages (Electronic computers)
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aLogic$3https://scigraph.springernature.com/ontologies/product-market-codes/E16000
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
615  0$aMathematical logic.
615  0$aLogic.
615  0$aComputers.
615  0$aArtificial intelligence.
615  0$aComputer logic.
615  0$aProgramming languages (Electronic computers).
615 14$aMathematical Logic and Formal Languages.
615 24$aLogic.
615 24$aTheory of Computation.
615 24$aArtificial Intelligence.
615 24$aLogics and Meanings of Programs.
615 24$aProgramming Languages, Compilers, Interpreters.
676   $a004.015113
700   $aNipkow$b Tobias$4aut$4http://id.loc.gov/vocabulary/relators/aut$062010
702   $aPaulson$b Lawrence C$4aut$4http://id.loc.gov/vocabulary/relators/aut
702   $aWenzel$b Markus$4aut$4http://id.loc.gov/vocabulary/relators/aut
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910145793603321
996   $aIsabelle$92223517
997   $aUNINA