Rewrite sentence about defunctionalization transformations
authorChristiaan Baaij <baaijcpr@wlan228123.mobiel.utwente.nl>
Tue, 2 Mar 2010 13:57:27 +0000 (14:57 +0100)
committerChristiaan Baaij <baaijcpr@wlan228123.mobiel.utwente.nl>
Tue, 2 Mar 2010 13:57:27 +0000 (14:57 +0100)
cλash.lhs

index e17914f26364a1741dc9f4d8891af370c3075347..d0ab48be1613fa1661f19c18905d47a6269f7c3c 100644 (file)
@@ -1083,8 +1083,9 @@ exhaustively applies a set of \emph{meaning-preserving} transformations on the
 \emph{Core} description until this description is in a \emph{normal form}. 
 This set of transformations includes transformations typically found in 
 reduction systems for lambda calculus, such a $\beta$-reduction and 
-$\eta$-expansion, but also includes \emph{defunctionalization} transformations 
-which reduce higher-order functions to `regular' first-order functions.
+$\eta$-expansion, but also includes self-defined transformations that are 
+responsible for the reduction of higher-order functions to `regular' 
+first-order functions.
 
 The final step in the compiler pipeline is the translation to a \VHDL\ 
 \emph{netlist}, which is a straightforward process due to resemblance of a