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