Isabelle/HOL

1. Front Matter

   Pages I-XIII

   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

4. Advanced Material

   1. 8. More about Types

      Pages 149-174

   2. 9. Advanced Simplification, Recursion, and Induction

      Pages 175-193

   3. 10. Case Study: Verifying a Security Protocol

      Pages 195-205

5. Back Matter

   Pages 207-218

   PDF

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.

• 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

• 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

Policies and ethics