X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Chapters%2FNormalization.tex;h=f9a10157970ad68d646a6d5948f697f516af8f23;hp=f4156b6131685dc6d81880ff80fec2d14b2bff16;hb=4b177f0eea59d8cc3e9da21a078583260d9f79c9;hpb=754d1564abbf23561192301163388a9494a91bbf diff --git a/Chapters/Normalization.tex b/Chapters/Normalization.tex index f4156b6..f9a1015 100644 --- a/Chapters/Normalization.tex +++ b/Chapters/Normalization.tex @@ -796,6 +796,7 @@ normal form. \placeintermezzo{}{ + \defref{substitution notation} \startframedtext[width=8cm,background=box,frame=no] \startalignment[center] {\tfa Substitution notation} @@ -888,7 +889,8 @@ This transformation is not needed to get an expression into intended normal form (since these bindings are part of the intended normal form), but makes the resulting \small{VHDL} a lot shorter. - + + \refdef{substitution notation} \starttrans letrec a0 = E0 @@ -1645,7 +1647,7 @@ This propagation makes higher order values become applied (in particular both of the alternatives of the case now have a - representable type. Completely applied top level functions (like the + representable type). Completely applied top level functions (like the first alternative) are now no longer invalid (they fall under \in{item}[item:completeapp] above). (Completely) applied lambda abstractions can be removed by β-abstraction. For our example, @@ -1820,6 +1822,7 @@ solves (part of) the polymorphism, higher order values and unrepresentable literals in an expression. + \refdef{substitution notation} \starttrans letrec a0 = E0 @@ -1942,7 +1945,6 @@ \todo{Examples. Perhaps reference the previous sections} - \section{Unsolved problems} The above system of transformations has been implemented in the prototype and seems to work well to compile simple and more complex examples of