author | wenzelm |
Tue, 21 Jul 1998 16:41:12 +0200 | |
changeset 5170 | 33fbffd06c12 |
parent 5167 | 10e033194e9d |
child 6072 | 5583261db33d |
permissions | -rw-r--r-- |
3096 | 1 |
\documentclass[12pt]{report} |
5165 | 2 |
\usepackage{graphicx,a4,latexsym,../pdfsetup} |
3096 | 3 |
|
2661 | 4 |
\makeatletter |
3287 | 5 |
\input{../proof.sty} |
2661 | 6 |
\input{../rail.sty} |
7 |
\input{../iman.sty} |
|
8 |
\input{../extra.sty} |
|
9 |
\makeatother |
|
10 |
||
104 | 11 |
%% $Id$ |
12 |
%%%STILL NEEDS MODAL, LCF |
|
111 | 13 |
%%%\includeonly{ZF} |
349 | 14 |
%%% to index derived rls: ^\([a-zA-Z0-9][a-zA-Z0-9_]*\) \\tdx{\1} |
15 |
%%% to index rulenames: ^ *(\([a-zA-Z0-9][a-zA-Z0-9_]*\), \\tdx{\1} |
|
16 |
%%% to index constants: \\tt \([a-zA-Z0-9][a-zA-Z0-9_]*\) \\cdx{\1} |
|
104 | 17 |
%%% to deverbify: \\verb|\([^|]*\)| \\ttindex{\1} |
18 |
%% run ../sedindex logics to prepare index file |
|
5170 | 19 |
\title{\includegraphics[scale=0.5]{isabelle.eps} \\[4ex] Isabelle's Object-Logics} |
104 | 20 |
|
3131 | 21 |
\author{{\em Lawrence C. Paulson}\\ |
22 |
Computer Laboratory \\ University of Cambridge \\ |
|
23 |
\texttt{lcp@cl.cam.ac.uk}\\[3ex] |
|
24 |
With Contributions by Tobias Nipkow and Markus Wenzel% |
|
25 |
\thanks{Tobias Nipkow revised and extended |
|
26 |
the chapter on \HOL. Markus Wenzel made numerous improvements. |
|
3005 | 27 |
Philippe de Groote wrote the |
104 | 28 |
first version of the logic~\LK{} and contributed to~\ZF{}. Tobias |
29 |
Nipkow developed~\HOL{}, \LCF{} and~\Cube{}. Philippe No\"el and |
|
30 |
Martin Coen made many contributions to~\ZF{}. Martin Coen |
|
3131 | 31 |
developed~\Modal{} with assistance from Rajeev Gor\'e. The research has |
32 |
been funded by the EPSRC (grants GR/G53279, GR/H40570, GR/K57381, |
|
33 |
GR/K77051) and by ESPRIT project 6453: Types.} |
|
34 |
} |
|
104 | 35 |
|
36 |
\newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip |
|
37 |
\hrule\bigskip} |
|
349 | 38 |
\newenvironment{constants}{\begin{center}\small\begin{tabular}{rrrr}}{\end{tabular}\end{center}} |
104 | 39 |
|
40 |
\makeindex |
|
41 |
||
287 | 42 |
%%\newenvironment{example}{\begin{Example}\rm}{\end{Example}} |
43 |
%%\newtheorem{Example}{Example}[chapter] |
|
44 |
||
104 | 45 |
\underscoreoff |
46 |
||
465 | 47 |
\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} %% {secnumdepth}{2}??? |
104 | 48 |
|
49 |
\pagestyle{headings} |
|
50 |
\sloppy |
|
51 |
\binperiod %%%treat . like a binary operator |
|
52 |
||
53 |
\begin{document} |
|
54 |
\maketitle |
|
55 |
\pagenumbering{roman} \tableofcontents \clearfirst |
|
56 |
\include{intro} |
|
57 |
\include{FOL} |
|
58 |
\include{ZF} |
|
1226 | 59 |
\include{HOL} |
104 | 60 |
\include{LK} |
61 |
%%\include{Modal} |
|
62 |
\include{CTT} |
|
63 |
%%\include{Cube} |
|
64 |
%%\include{LCF} |
|
65 |
\bibliographystyle{plain} |
|
2933
f842a75d9624
Updated discussion and references for inductive definitions
paulson
parents:
2661
diff
changeset
|
66 |
\bibliography{string,general,atp,theory,funprog,logicprog,isabelle,crossref} |
104 | 67 |
\input{logics.ind} |
68 |
\end{document} |