--- a/doc-src/TutorialI/Recdef/document/examples.tex Thu Aug 17 21:07:25 2000 +0200
+++ b/doc-src/TutorialI/Recdef/document/examples.tex Fri Aug 18 10:34:08 2000 +0200
@@ -11,13 +11,13 @@
\begin{isamarkuptext}%
\noindent
The definition of \isa{fib} is accompanied by a \bfindex{measure function}
-\isa{{\isasymlambda}n.\ n} which maps the argument of \isa{fib} to a
+\isa{{\isasymlambda}\mbox{n}.\ \mbox{n}} which maps the argument of \isa{fib} to a
natural number. The requirement is that in each equation the measure of the
argument on the left-hand side is strictly greater than the measure of the
argument of each recursive call. In the case of \isa{fib} this is
obviously true because the measure function is the identity and
-\isa{Suc\ (Suc\ x)} is strictly greater than both \isa{x} and
-\isa{Suc\ x}.
+\isa{Suc\ (Suc\ \mbox{x})} is strictly greater than both \isa{x} and
+\isa{Suc\ \mbox{x}}.
Slightly more interesting is the insertion of a fixed element
between any two elements of a list:%