X-Git-Url: https://git.stderr.nl/gitweb?a=blobdiff_plain;f=Chapters%2FNormalization.tex;h=78b7a1d2e2352662fd759c495af3904b7fdd163b;hb=ee64b2e24b792c580ba5c0bfa38c5ed642800945;hp=d3b37003774e7f81abf3e6fc8661bf47811ce3f6;hpb=2790ccea19648fe307a85db7485ec8986e63e773;p=matthijs%2Fmaster-project%2Freport.git diff --git a/Chapters/Normalization.tex b/Chapters/Normalization.tex index d3b3700..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 @@ -1367,7 +1367,7 @@ False -> b \stopbuffer - \transexample{letflat}{Let flattening}{from}{to} + \transexample{letflat}{Case normalisation}{from}{to} \subsubsection{Case simplification}