- Now uses Orderings as parent theory
- "'a set" is now just a type abbreviation for "'a => bool"
- The instantiation "set :: (type) ord" and the definition of (p)subset is
no longer needed, since it is subsumed by the order on functions and booleans.
The derived theorems (p)subset_eq can be used as a replacement.
- mem_Collect_eq and Collect_mem_eq can now be derived from the definitions
of mem and Collect.
- Replaced the instantiation "set :: (type) minus" by the two instantiations
"fun :: (type, minus) minus" and "bool :: minus". The theorem set_diff_eq
can be used as a replacement for the definition set_diff_def
- Replaced the instantiation "set :: (type) uminus" by the two instantiations
"fun :: (type, uminus) uminus" and "bool :: uminus". The theorem Compl_eq
can be used as a replacement for the definition Compl_def.
- Variable P in rule split_if must be instantiated manually in proof of
split_if_mem2 due to problems with HO unification
- Moved definition of dense linear orders and proofs about LEAST from
Orderings to Set
- Deleted code setup for sets
% $Id$
\documentclass[11pt,a4paper]{article}
\usepackage{graphicx,isabelle,isabellesym}
\usepackage{pdfsetup}
\urlstyle{rm}
\isabellestyle{it}
\pagestyle{myheadings}
\begin{document}
\title{Machine Words in Isabelle/HOL}
\author{Jeremy Dawson, Paul Graunke, Brian Huffman, Gerwin Klein, and John Matthews}
\maketitle
\begin{abstract}
A formalisation of generic, fixed size machine words in Isabelle/HOL. An earlier version of this
formalisation is described in \cite{dawson-avocs07}.
\end{abstract}
\tableofcontents
\begin{center}
\includegraphics[width=\textwidth,height=\textheight,keepaspectratio]{session_graph}
\end{center}
\newpage
\renewcommand{\isamarkupheader}[1]%
{\section{\isabellecontext: #1}\markright{THEORY~``\isabellecontext''}}
\parindent 0pt\parskip 0.5ex
\input{session}
\bibliographystyle{plain}
\bibliography{root}
\end{document}