--- a/doc-src/TutorialI/Types/types.tex Thu Aug 09 10:17:45 2001 +0200
+++ b/doc-src/TutorialI/Types/types.tex Thu Aug 09 18:12:15 2001 +0200
@@ -18,7 +18,8 @@
The material in this section goes beyond the needs of most novices. Serious
users should at least skim the sections on basic types and on type classes.
-The latter is fairly advanced: read the beginning to understand what it is
+The latter material is fairly advanced; read the beginning to understand what
+it is
about, but consult the rest only when necessary.
\input{Types/numerics}
@@ -44,8 +45,9 @@
an axiomatic specification of a class of types. Thus we can talk about a type
$\tau$ being in a class $C$, which is written $\tau :: C$. This is the case if
$\tau$ satisfies the axioms of $C$. Furthermore, type classes can be
-organized in a hierarchy. Thus there is the notion of a class $D$ being a
-\textbf{subclass} of a class $C$, written $D < C$. This is the case if all
+organized in a hierarchy. Thus there is the notion of a class $D$ being a
+\textbf{subclass}\index{subclasses}
+of a class $C$, written $D < C$. This is the case if all
axioms of $C$ are also provable in $D$. We introduce these concepts
by means of a running example, ordering relations.