X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Chapters%2FNormalization.tex;h=b74333ae103c15d51b08fa37cc708cc7c3f1503b;hp=7c6b46958e606b899cbf42e8f997fa645e0d5412;hb=f03ce6925c4709f4a92f5371347050fc65147e3f;hpb=1fc4b09400e7d602d794b3ce0c1a4c032047aa98

diff --git a/Chapters/Normalization.tex b/Chapters/Normalization.tex
index 7c6b469..b74333a 100644
--- a/Chapters/Normalization.tex
+++ b/Chapters/Normalization.tex
@@ -15,10 +15,6 @@
 }
 
 
-% A transformation example
-\definefloat[example][examples]
-\setupcaption[example][location=top] % Put captions on top
-
 \define[3]\transexample{
   \placeexample[here]{#1}
   \startcombination[2*1]
@@ -886,7 +882,7 @@ in scope for the function return value).
 Note that this transformation does not try to be smart when faced with
 recursive lets, it will just leave the lets recursive (possibly joining a
 recursive and non-recursive let into a single recursive let). The let
-rederursification transformation will do this instead.
+rederecursification transformation will do this instead.
 
 \starttrans
 letnonrec x = (let bindings in M) in N