Skip to main content
SpringerLink
Log in

Isabelle/HOL

A Proof Assistant for Higher-Order Logic

  • Textbook
  • © 2002

Overview

Editors:
  1. Tobias Nipkow

    1. Institut für Informatik, Technische Universität München, München, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Markus Wenzel

    1. Institut für Informatik, Technische Universität München, München, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Lawrence C. Paulson

    1. Computer Laboratory, University of Cambridge, Cambridge, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2283)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Elementary Techniques

    1. 1. The Basics

      Pages 3-8

    2. 2. Functional Programming in HOL

      Pages 9-26

    3. 3. More Functional Programming

      Pages 27-51

    4. 4. Presenting Theories

      Pages 53-64

  3. Logic and Sets

    1. 5. The Rules of the Game

      Pages 67-104

    2. 6. Sets, Functions, and Relations

      Pages 105-126

    3. 7. Inductively Defined Sets

      Pages 127-145

  5. Back Matter

    Pages 207-218
    Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Institut für Informatik, Technische Universität München, München, Germany

    Tobias Nipkow, Markus Wenzel

  • Computer Laboratory, University of Cambridge, Cambridge, UK

    Lawrence C. Paulson

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation