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