|
9796
|
1 |
|
|
|
2 |
% $Id$
|
|
7741
|
3 |
|
|
|
4 |
\input{style}
|
|
|
5 |
|
|
|
6 |
\hyphenation{Isabelle}
|
|
|
7 |
|
|
|
8 |
\begin{document}
|
|
|
9 |
|
|
|
10 |
\title{Miscellaneous Isabelle/Isar examples for Higher-Order Logic}
|
|
8051
|
11 |
\author{Markus Wenzel \\ \url{http://www.in.tum.de/~wenzelm/} \\[2ex]
|
|
8052
|
12 |
With contributions by Gertrud Bauer and Tobias Nipkow}
|
|
7741
|
13 |
\maketitle
|
|
|
14 |
|
|
|
15 |
\begin{abstract}
|
|
7874
|
16 |
Isar offers a high-level proof (and theory) language for Isabelle.
|
|
|
17 |
We give various examples of Isabelle/Isar proof developments,
|
|
|
18 |
ranging from simple demonstrations of certain language features to
|
|
|
19 |
more advanced applications.
|
|
7741
|
20 |
\end{abstract}
|
|
|
21 |
|
|
|
22 |
\tableofcontents
|
|
7869
|
23 |
|
|
|
24 |
\parindent 0pt \parskip 0.5ex
|
|
8189
|
25 |
|
|
10146
|
26 |
\input{BasicLogic.tex}
|
|
|
27 |
\input{Cantor.tex}
|
|
|
28 |
\input{Peirce.tex}
|
|
|
29 |
\input{ExprCompiler.tex}
|
|
|
30 |
\input{Group.tex}
|
|
|
31 |
\input{Summation.tex}
|
|
|
32 |
\input{KnasterTarski.tex}
|
|
|
33 |
\input{MutilatedCheckerboard.tex}
|
|
|
34 |
%\input{Multiset0.tex}
|
|
|
35 |
%\input{Acc.tex}
|
|
|
36 |
%\input{Multiset.tex}
|
|
|
37 |
\input{MultisetOrder.tex}
|
|
|
38 |
%\input{Maybe.tex}
|
|
|
39 |
%\input{Type.tex}
|
|
|
40 |
\input{W_correct.tex}
|
|
|
41 |
%\input{Primes.tex}
|
|
|
42 |
\input{Fibonacci.tex}
|
|
|
43 |
\input{Puzzle.tex}
|
|
|
44 |
\input{NestedDatatype.tex}
|
|
|
45 |
\input{Hoare.tex}
|
|
|
46 |
\input{HoareEx.tex}
|
|
7741
|
47 |
|
|
7816
|
48 |
\nocite{isabelle-isar-ref,Wenzel:1999:TPHOL}
|
|
|
49 |
\bibliographystyle{plain}
|
|
|
50 |
\bibliography{root}
|
|
|
51 |
|
|
7741
|
52 |
\end{document}
|