author wenzelm
Wed, 26 Jul 2006 00:44:44 +0200
changeset 20207 4c57e850e8d5
parent 17659 b1019337c857
child 42518 57367832b81a
permissions -rw-r--r--
added Pure/subgoal.ML;

%% $Id$

%%% to index derived rls:  ^\([a-zA-Z0-9][a-zA-Z0-9_]*\)        \\tdx{\1}  
%%% to index rulenames:   ^ *(\([a-zA-Z0-9][a-zA-Z0-9_]*\),     \\tdx{\1}  
%%% to index constants:   \\tt \([a-zA-Z0-9][a-zA-Z0-9_]*\)     \\cdx{\1}  
%%% to deverbify:         \\verb|\([^|]*\)|     \\ttindex{\1}  

\title{\includegraphics[scale=0.5]{isabelle_hol} \\[4ex]
  Isabelle's Logics: HOL%
  \thanks{The research has been funded by the EPSRC (grants GR/G53279,
    GR\slash H40570, GR/K57381, GR/K77051, GR/M75440), by ESPRIT (projects 3245:
    Logical Frameworks, and 6453: Types) and by the DFG Schwerpunktprogramm

\author{Tobias Nipkow\footnote
{Institut f\"ur Informatik, Technische Universit\"at M\"unchen,
 \texttt{}} and
Lawrence C. Paulson\footnote
{Computer Laboratory, University of Cambridge, \texttt{}} and
Markus Wenzel\footnote
{Institut f\"ur Informatik, Technische Universit\"at M\"unchen,

\newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip

\newcommand\bs{\char '134 }  % A backslash character for \tt font



\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2}  %% {secnumdepth}{2}???

\binperiod     %%%treat . like a binary operator


  This manual describes Isabelle's formalization of Higher-Order Logic, a
  polymorphic version of Church's Simple Theory of Types.  HOL can be best
  understood as a simply-typed version of classical set theory.  The monograph
  \emph{Isabelle/HOL --- A Proof Assistant for Higher-Order Logic} provides a
  gentle introduction on using Isabelle/HOL in practice.

\pagenumbering{roman} \tableofcontents \clearfirst