X-Git-Url: https://git.stderr.nl/gitweb?a=blobdiff_plain;f=Chapters%2FNormalization.tex;h=78b7a1d2e2352662fd759c495af3904b7fdd163b;hb=ee64b2e24b792c580ba5c0bfa38c5ed642800945;hp=714ce88c0c6a663b2c7cf517db11f0243718ed87;hpb=469c28edabf61f131bd29bb76838b615a84acc9a;p=matthijs%2Fmaster-project%2Freport.git

diff --git a/Chapters/Normalization.tex b/Chapters/Normalization.tex
index 714ce88..78b7a1d 100644
--- a/Chapters/Normalization.tex
+++ b/Chapters/Normalization.tex
@@ -1084,7 +1084,7 @@
 
         \transexample{apppropcase}{Application propagation for a case expression}{from}{to}
 
-      \subsubsection{Let recursification}
+      \subsubsection[sec:normalization:letrecurse]{Let recursification}
         This transformation makes all non-recursive lets recursive. In the
         end, we want a single recursive let in our normalized program, so all
         non-recursive lets can be converted. This also makes other