000 04273nam a22006375i 4500
001 978-3-540-45949-1
003 DE-He213
005 20240423132517.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540459491
_9978-3-540-45949-1
024 7 _a10.1007/3-540-45949-9
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
100 1 _aNipkow, Tobias.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aIsabelle/HOL
_h[electronic resource] :
_bA Proof Assistant for Higher-Order Logic /
_cby Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aXIV, 226 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2283
505 0 _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.
520 _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.
650 0 _aMachine theory.
650 0 _aLogic.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aCompilers (Computer programs).
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aLogic.
650 2 4 _aTheory of Computation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aCompilers and Interpreters.
700 1 _aPaulson, Lawrence C.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
700 1 _aWenzel, Markus.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540433767
776 0 8 _iPrinted edition:
_z9783662182291
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2283
856 4 0 _uhttps://doi.org/10.1007/3-540-45949-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188544
_d188544