doc-src/TutorialI/fp.tex
changeset 9493 494f8cd34df7
parent 9458 c613cd06d5cf
child 9494 44fefb6e9994
--- a/doc-src/TutorialI/fp.tex	Tue Aug 01 18:26:34 2000 +0200
+++ b/doc-src/TutorialI/fp.tex	Wed Aug 02 11:30:38 2000 +0200
@@ -197,7 +197,7 @@
 A more general method for defining total recursive functions is introduced in
 \S\ref{sec:recdef}.
 
-\begin{exercise}
+\begin{exercise}\label{ex:Tree}
 \input{Misc/document/Tree.tex}%
 \end{exercise}
 
@@ -679,6 +679,9 @@
 \isa{rev xs \at\ ys} is simpler than \isa{itrev xs ys}. But see what
 happens if you try to prove \isa{rev xs \at\ ys = itrev xs ys}!
 
+\begin{exercise}
+\input{Misc/document/Tree2.tex}%
+\end{exercise}
 
 \section{Case study: compiling expressions}
 \label{sec:ExprCompiler}