doc-src/Intro/intro.tex
author berghofe
Fri May 02 16:18:49 1997 +0200 (1997-05-02)
changeset 3096 ccc2c92bb232
parent 2976 7c848e330a80
child 3127 4cc2fe62f7c3
permissions -rw-r--r--
Updated to LaTeX 2e
berghofe@3096
     1
\documentclass[12pt]{article}
berghofe@3096
     2
\usepackage{a4}
berghofe@3096
     3
wenzelm@2656
     4
\makeatletter
berghofe@3096
     5
\input{../proof.sty}
wenzelm@2656
     6
\input{../iman.sty}
wenzelm@2656
     7
\input{../extra.sty}
wenzelm@2656
     8
\makeatother
wenzelm@2656
     9
lcp@105
    10
%% $Id$
lcp@105
    11
%% run    bibtex intro         to prepare bibliography
lcp@105
    12
%% run    ../sedindex intro    to prepare index file
lcp@105
    13
%prth *(\(.*\));          \1;      
lcp@105
    14
%{\\out \(.*\)}          {\\out val it = "\1" : thm}
lcp@105
    15
lcp@105
    16
\title{Introduction to Isabelle}   
lcp@105
    17
\author{{\em Lawrence C. Paulson}\\
lcp@105
    18
        Computer Laboratory \\ University of Cambridge \\[2ex]
lcp@105
    19
        {\small{\em Electronic mail\/}: {\tt lcp@cl.cam.ac.uk}}
lcp@105
    20
}
lcp@105
    21
\makeindex
lcp@105
    22
lcp@105
    23
\underscoreoff
lcp@105
    24
lcp@105
    25
\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2}
lcp@105
    26
lcp@105
    27
\sloppy
lcp@105
    28
\binperiod     %%%treat . like a binary operator
lcp@105
    29
lcp@105
    30
\newcommand\qeq{\stackrel{?}{\equiv}}  %for disagreement pairs in unification
lcp@105
    31
\newcommand{\nand}{\mathbin{\lnot\&}} 
lcp@105
    32
\newcommand{\xor}{\mathbin{\#}}
lcp@105
    33
lcp@105
    34
\pagenumbering{roman} 
lcp@105
    35
\begin{document}
lcp@105
    36
\pagestyle{empty}
lcp@105
    37
\begin{titlepage}
lcp@105
    38
\maketitle 
lcp@105
    39
\thispagestyle{empty}
lcp@105
    40
\vfill
lcp@105
    41
{\small Copyright \copyright{} \number\year{} by Lawrence C. Paulson}
lcp@105
    42
\end{titlepage}
lcp@105
    43
lcp@105
    44
\pagestyle{headings}
lcp@105
    45
\part*{Preface}
paulson@1878
    46
\index{Isabelle!overview} \index{Isabelle!object-logics supported}
paulson@1878
    47
Isabelle~\cite{paulson-natural,paulson-found,paulson700} is a generic theorem
paulson@1878
    48
prover.  It has been instantiated to support reasoning in several
paulson@1878
    49
object-logics:
lcp@105
    50
\begin{itemize}
lcp@105
    51
\item first-order logic, constructive and classical versions
lcp@105
    52
\item higher-order logic, similar to that of Gordon's {\sc
lcp@348
    53
hol}~\cite{mgordon-hol}
lcp@105
    54
\item Zermelo-Fraenkel set theory~\cite{suppes72}
lcp@105
    55
\item an extensional version of Martin-L\"of's Type Theory~\cite{nordstrom90}
lcp@105
    56
\item the classical first-order sequent calculus, {\sc lk}
lcp@105
    57
\item the modal logics $T$, $S4$, and $S43$
lcp@105
    58
\item the Logic for Computable Functions~\cite{paulson87}
lcp@105
    59
\end{itemize}
lcp@105
    60
A logic's syntax and inference rules are specified declaratively; this
lcp@105
    61
allows single-step proof construction.  Isabelle provides control
lcp@105
    62
structures for expressing search procedures.  Isabelle also provides
lcp@105
    63
several generic tools, such as simplifiers and classical theorem provers,
lcp@105
    64
which can be applied to object-logics.
lcp@105
    65
lcp@105
    66
\index{ML}
lcp@105
    67
Isabelle is a large system, but beginners can get by with a small
lcp@105
    68
repertoire of commands and a basic knowledge of how Isabelle works.  Some
lcp@105
    69
knowledge of Standard~\ML{} is essential, because \ML{} is Isabelle's user
lcp@105
    70
interface.  Advanced Isabelle theorem proving can involve writing \ML{}
lcp@105
    71
code, possibly with Isabelle's sources at hand.  My book
lcp@105
    72
on~\ML{}~\cite{paulson91} covers much material connected with Isabelle,
lcp@105
    73
including a simple theorem prover.  Users must be familiar with logic as
lcp@105
    74
used in computer science; there are many good
lcp@105
    75
texts~\cite{galton90,reeves90}.
lcp@105
    76
lcp@105
    77
\index{LCF}
lcp@348
    78
{\sc lcf}, developed by Robin Milner and colleagues~\cite{mgordon79}, is an
lcp@105
    79
ancestor of {\sc hol}, Nuprl, and several other systems.  Isabelle borrows
lcp@105
    80
ideas from {\sc lcf}: formulae are~\ML{} values; theorems belong to an
lcp@105
    81
abstract type; tactics and tacticals support backward proof.  But {\sc lcf}
lcp@105
    82
represents object-level rules by functions, while Isabelle represents them
lcp@105
    83
by terms.  You may find my other writings~\cite{paulson87,paulson-handbook}
lcp@105
    84
helpful in understanding the relationship between {\sc lcf} and Isabelle.
lcp@105
    85
lcp@105
    86
\index{Isabelle!release history} Isabelle was first distributed in 1986.
lcp@105
    87
The 1987 version introduced a higher-order meta-logic with an improved
lcp@105
    88
treatment of quantifiers.  The 1988 version added limited polymorphism and
lcp@105
    89
support for natural deduction.  The 1989 version included a parser and
lcp@105
    90
pretty printer generator.  The 1992 version introduced type classes, to
lcp@105
    91
support many-sorted and higher-order logics.  The current version provides
lcp@105
    92
greater support for theories and is much faster.  Isabelle is still under
lcp@105
    93
development and will continue to change.
lcp@105
    94
lcp@105
    95
\subsubsection*{Overview} 
lcp@296
    96
This manual consists of three parts.  Part~I discusses the Isabelle's
lcp@296
    97
foundations.  Part~II, presents simple on-line sessions, starting with
lcp@296
    98
forward proof.  It also covers basic tactics and tacticals, and some
lcp@296
    99
commands for invoking them.  Part~III contains further examples for users
lcp@296
   100
with a bit of experience.  It explains how to derive rules define theories,
lcp@296
   101
and concludes with an extended example: a Prolog interpreter.
lcp@105
   102
lcp@105
   103
Isabelle's Reference Manual and Object-Logics manual contain more details.
lcp@105
   104
They assume familiarity with the concepts presented here.
lcp@105
   105
lcp@105
   106
lcp@105
   107
\subsubsection*{Acknowledgements} 
lcp@311
   108
Tobias Nipkow contributed most of the section on defining theories.
paulson@1866
   109
Stefan Berghofer, Sara Kalvala and Markus Wenzel suggested improvements.
lcp@105
   110
lcp@105
   111
Tobias Nipkow has made immense contributions to Isabelle, including the
lcp@184
   112
parser generator, type classes, and the simplifier.  Carsten Clasohm and
lcp@184
   113
Markus Wenzel made major contributions; Sonia Mahjoub and Karin Nimmermann
lcp@184
   114
also helped.  Isabelle was developed using Dave Matthews's Standard~{\sc
lcp@184
   115
  ml} compiler, Poly/{\sc ml}.  Many people have contributed to Isabelle's
lcp@184
   116
standard object-logics, including Martin Coen, Philippe de Groote, Philippe
lcp@184
   117
No\"el.  The research has been funded by the SERC (grants GR/G53279,
lcp@184
   118
GR/H40570) and by ESPRIT (projects 3245: Logical Frameworks, and 6453:
lcp@184
   119
Types).
lcp@105
   120
lcp@105
   121
\newpage
lcp@105
   122
\pagestyle{plain} \tableofcontents 
lcp@105
   123
\newpage
lcp@105
   124
lcp@105
   125
\newfont{\sanssi}{cmssi12}
lcp@105
   126
\vspace*{2.5cm}
lcp@105
   127
\begin{quote}
lcp@105
   128
\raggedleft
lcp@105
   129
{\sanssi
lcp@105
   130
You can only find truth with logic\\
lcp@105
   131
if you have already found truth without it.}\\
lcp@105
   132
\bigskip
lcp@105
   133
lcp@105
   134
G.K. Chesterton, {\em The Man who was Orthodox}
lcp@105
   135
\end{quote}
lcp@105
   136
lcp@105
   137
\clearfirst  \pagestyle{headings}
lcp@105
   138
\include{foundations}
lcp@105
   139
\include{getting}
lcp@105
   140
\include{advanced}
lcp@105
   141
lcp@105
   142
\bibliographystyle{plain} \small\raggedright\frenchspacing
lcp@873
   143
\bibliography{string,atp,funprog,general,logicprog,isabelle,theory,crossref}
lcp@105
   144
lcp@105
   145
\input{intro.ind}
lcp@105
   146
\end{document}