doc-src/TutorialI/Recdef/document/simplification.tex
changeset 8771 026f37a86ea7
parent 8749 2665170f104a
child 9145 9f7b8de5bfaf
--- a/doc-src/TutorialI/Recdef/document/simplification.tex	Sun Apr 23 11:41:45 2000 +0200
+++ b/doc-src/TutorialI/Recdef/document/simplification.tex	Tue Apr 25 08:09:10 2000 +0200
@@ -42,10 +42,10 @@
 \begin{isamarkuptext}%
 \noindent
 Since the recursive call \isa{gcd(n, m mod n)} is no longer protected by
-an \isa{if}, this leads to an infinite chain of simplification steps.
+an \isa{if}, it is unfolded again, which leads to an infinite chain of simplification steps.
 Fortunately, this problem can be avoided in many different ways.
 
-Of course the most radical solution is to disable the offending
+The most radical solution is to disable the offending
 \isa{split_if} as shown in the section on case splits in
 \S\ref{sec:SimpFeatures}.
 However, we do not recommend this because it means you will often have to