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