author kleing
Mon, 29 Dec 2003 06:49:26 +0100
changeset 14333 14f29eb097a3
parent 12343 b05331869f79
child 17133 096792bdc58e
permissions -rw-r--r--
\<^bsub> .. \<^esub>

\usepackage{../pdfsetup}  % last one!




  \\[4ex] Using Axiomatic Type Classes in Isabelle}
\author{\emph{Markus Wenzel} \\ TU M\"unchen}

\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2}

\binperiod     %%%treat . like a binary operator




  Isabelle offers order-sorted type classes on top of the simple types of
  plain Higher-Order Logic.  The resulting type system is similar to that of
  the programming language Haskell.  Its interpretation within the logic
  enables further application, though, apart from restricting polymorphism
  syntactically.  In particular, the concept of \emph{Axiomatic Type Classes}
  provides a useful light-weight mechanism for hierarchically-structured
  abstract theories. Subsequently, we demonstrate typical uses of Isabelle's
  axiomatic type classes to model basic algebraic structures.
  This document describes axiomatic type classes using Isabelle/Isar theories,
  with proofs expressed via Isar proof language elements.  The new theory
  format greatly simplifies the arrangement of the overall development, since
  definitions and proofs may be freely intermixed.  Users who prefer tactic
  scripts over structured proofs do not need to fall back on separate ML
  scripts, though, but may refer to Isar's tactic emulation commands.

\pagenumbering{roman} \tableofcontents \clearfirst



  \bibliographystyle{plain} \small\raggedright\frenchspacing


%%% Local Variables: 
%%% mode: latex
%%% TeX-master: t
%%% End: 
% LocalWords:  Isabelle FIXME