
wenzelm@6580: %% $Id$
wenzelm@7835: \documentclass[12pt,a4paper]{report}
berghofe@17659: \usepackage{graphicx,../iman,../extra,../ttbox,../proof,../rail,../railsetup,latexsym,../pdfsetup}
wenzelm@6580: 
wenzelm@6580: %%% to index derived rls:  ^\([a-zA-Z0-9][a-zA-Z0-9_]*\)        \\tdx{\1}  
wenzelm@6580: %%% to index rulenames:   ^ *(\([a-zA-Z0-9][a-zA-Z0-9_]*\),     \\tdx{\1}  
wenzelm@6580: %%% to index constants:   \\tt \([a-zA-Z0-9][a-zA-Z0-9_]*\)     \\cdx{\1}  
wenzelm@6580: %%% to deverbify:         \\verb|\([^|]*\)|     \\ttindex{\1}  
wenzelm@6580: 
paulson@8979: 
paulson@8979: \title{\includegraphics[scale=0.5]{isabelle_hol} \\[4ex]
paulson@8979:   Isabelle's Logics: HOL%
paulson@8979:   \thanks{The research has been funded by the EPSRC (grants GR/G53279,
paulson@9212:     GR\slash H40570, GR/K57381, GR/K77051, GR/M75440), by ESPRIT (projects 3245:
paulson@8979:     Logical Frameworks, and 6453: Types) and by the DFG Schwerpunktprogramm
paulson@8979:     \emph{Deduktion}.}}
wenzelm@6580: 
nipkow@6605: \author{Tobias Nipkow\footnote
nipkow@6605: {Institut f\"ur Informatik, Technische Universit\"at M\"unchen,
wenzelm@6626:  \texttt{nipkow@in.tum.de}} and
nipkow@6605: Lawrence C. Paulson\footnote
wenzelm@6626: {Computer Laboratory, University of Cambridge, \texttt{lcp@cl.cam.ac.uk}} and
nipkow@6605: Markus Wenzel\footnote
nipkow@6605: {Institut f\"ur Informatik, Technische Universit\"at M\"unchen,
nipkow@6605:  \texttt{wenzelm@in.tum.de}}}
wenzelm@6580: 
wenzelm@6580: \newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip
wenzelm@6580:   \hrule\bigskip}
wenzelm@6580: \newenvironment{constants}{\begin{center}\small\begin{tabular}{rrrr}}{\end{tabular}\end{center}}
wenzelm@6580: 
berghofe@17659: \newcommand\bs{\char '134 }  % A backslash character for \tt font
berghofe@17659: 
wenzelm@6580: \makeindex
wenzelm@6580: 
wenzelm@6580: \underscoreoff
wenzelm@6580: 
wenzelm@6580: \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2}  %% {secnumdepth}{2}???
wenzelm@6580: 
wenzelm@6580: \pagestyle{headings}
wenzelm@6580: \sloppy
wenzelm@6580: \binperiod     %%%treat . like a binary operator
wenzelm@6580: 
wenzelm@6580: \begin{document}
wenzelm@6580: \maketitle 
wenzelm@6580: 
wenzelm@6580: \begin{abstract}
wenzelm@6580:   This manual describes Isabelle's formalization of Higher-Order Logic, a
wenzelm@6580:   polymorphic version of Church's Simple Theory of Types.  HOL can be best
wenzelm@13028:   understood as a simply-typed version of classical set theory.  The monograph
wenzelm@13028:   \emph{Isabelle/HOL --- A Proof Assistant for Higher-Order Logic} provides a
wenzelm@13028:   gentle introduction on using Isabelle/HOL in practice.
wenzelm@6580: \end{abstract}
wenzelm@6580: 
wenzelm@6580: \pagenumbering{roman} \tableofcontents \clearfirst
wenzelm@6620: \input{../Logics/syntax}
wenzelm@6580: \include{HOL}
wenzelm@6580: \bibliographystyle{plain}
paulson@6592: \bibliography{../manual}
wenzelm@8828: \printindex
wenzelm@6580: \end{document}




