Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Isabelle/HOL - A Proof Assistant for Higher-Order Logic

Isabelle/HOL

A Proof Assistant for Higher-Order Logic

Nipkow, Tobias, Paulson, Lawrence C., Wenzel, Markus

2002, XIV, 226 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.95

(net) price for USA

ISBN 978-3-540-45949-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$69.95

(net) price for USA

ISBN 978-3-540-43376-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this textbook

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

Content Level » Research

Keywords » Formal Methods - Formal Reasoning - Formal Specification - Formal Verification - Functional Programming - Higher-Order Logic - Interactive Proof Systems - Isabelle - Proof Assistants - Proof Theory - Theorem Proving - Type Theory - logic - predicate logic - verification

Related subjects » Artificial Intelligence - Logic & Philosophy of Language - Software Engineering - Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Formal Languages.