Picture 1 of 1

Stock photo

Isabelle/Hol : A Proof Assistant for Higher-Order Logic, Paperback by Nipkow,... - Picture 1 of 1

Lecture Notes in Computer Science Ser.: Isabelle/HOL : A Proof Assistant for Higher-Order Logic by Markus Wenzel, Lawrence C. Paulson and Tobias Nipkow (2002, Trade Paperback)

Great Book Prices Store (347874)

97.3% positive feedback

Price:

$68.16

Free shipping

Estimated delivery Fri, Oct 10 - Sat, Oct 18

Returns:

14 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

About this product

Product Identifiers

PublisherSpringer Berlin / Heidelberg

ISBN-103540433767

ISBN-139783540433767

eBay Product ID (ePID)2210792

Product Key Features

Number of PagesXiv, 226 Pages

LanguageEnglish

Publication NameIsabelle/Hol : a Proof Assistant for Higher-Order Logic

SubjectIntelligence (Ai) & Semantics, Computer Science, Logic

Publication Year2002

TypeTextbook

AuthorMarkus Wenzel, Lawrence C. Paulson, Tobias Nipkow

Subject AreaPhilosophy, Computers

SeriesLecture Notes in Computer Science Ser.

FormatTrade Paperback

Dimensions

Item Weight26.8 Oz

Item Length9.3 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN2002-020906

Dewey Edition21

Series Volume Number2283

Number of Volumes1 vol.

IllustratedYes

Dewey Decimal004.01/5113

Table Of ContentElementary 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.

SynopsisThis 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.

LC Classification NumberQA267-268.5