author wenzelm
Mon, 13 Mar 2000 13:21:39 +0100
changeset 8434 5e4bba59bfaa
parent 7835 e9cd3f3be589
child 8828 5be2d1745c61
permissions -rw-r--r--
use HOLogic.Not; export indexify_names;

%% $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}

\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,
%\thanks{The research has been funded by the EPSRC (grants
%          GR/G53279, GR/H40570, GR/K57381, GR/K77051), by ESPRIT project
%          6453: Types, and by the DFG Schwerpunktprogramm \emph{Deduktion}.}

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



\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.  See also
  \emph{Isabelle/HOL --- The Tutorial} for a gentle introduction on using
  Isabelle/HOL, and the \emph{Isabelle Reference Manual} for general Isabelle

\pagenumbering{roman} \tableofcontents \clearfirst