2 \documentclass[12pt,a4paper]{report}
3 \usepackage{graphicx,../iman,../extra,../ttbox,../proof,../rail,latexsym,../pdfsetup}
5 %%% to index derived rls: ^\([a-zA-Z0-9][a-zA-Z0-9_]*\) \\tdx{\1}
6 %%% to index rulenames: ^ *(\([a-zA-Z0-9][a-zA-Z0-9_]*\), \\tdx{\1}
7 %%% to index constants: \\tt \([a-zA-Z0-9][a-zA-Z0-9_]*\) \\cdx{\1}
8 %%% to deverbify: \\verb|\([^|]*\)| \\ttindex{\1}
11 \title{\includegraphics[scale=0.5]{isabelle_hol} \\[4ex]
12 Isabelle's Logics: HOL%
13 \thanks{The research has been funded by the EPSRC (grants GR/G53279,
14 GR\slash H40570, GR/K57381, GR/K77051, GR/M75440), by ESPRIT (projects 3245:
15 Logical Frameworks, and 6453: Types) and by the DFG Schwerpunktprogramm
18 \author{Tobias Nipkow\footnote
19 {Institut f\"ur Informatik, Technische Universit\"at M\"unchen,
20 \texttt{nipkow@in.tum.de}} and
21 Lawrence C. Paulson\footnote
22 {Computer Laboratory, University of Cambridge, \texttt{lcp@cl.cam.ac.uk}} and
23 Markus Wenzel\footnote
24 {Institut f\"ur Informatik, Technische Universit\"at M\"unchen,
25 \texttt{wenzelm@in.tum.de}}}
27 \newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip
29 \newenvironment{constants}{\begin{center}\small\begin{tabular}{rrrr}}{\end{tabular}\end{center}}
35 \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} %% {secnumdepth}{2}???
39 \binperiod %%%treat . like a binary operator
45 This manual describes Isabelle's formalization of Higher-Order Logic, a
46 polymorphic version of Church's Simple Theory of Types. HOL can be best
47 understood as a simply-typed version of classical set theory. The monograph
48 \emph{Isabelle/HOL --- A Proof Assistant for Higher-Order Logic} provides a
49 gentle introduction on using Isabelle/HOL in practice.
52 \pagenumbering{roman} \tableofcontents \clearfirst
53 \input{../Logics/syntax}
55 \bibliographystyle{plain}
56 \bibliography{../manual}