-The output of the \GHC\ front-end is the original Haskell description
-translated to \emph{Core}~\cite{Sulzmann2007}, which is smaller, typed,
-functional language that is relatively easier to process than the larger
-Haskell language. A description in \emph{Core} can still contain properties
-which have no direct translation to hardware, such as polymorphic types and
-function-valued arguments. Such a description needs to be transformed to a
-\emph{normal form}, which only contains properties that have a direct
-translation. The second stage of the compiler, the \emph{normalization} phase,
-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~\cite{lambdacalculus}, such a
-$\beta$-reduction and $\eta$-expansion, but also includes self-defined
-transformations that are responsible for the reduction of higher-order
-functions to `regular' first-order functions.
+The output of the \GHC\ front-end consists of the translation of the original Haskell description in \emph{Core}~\cite{Sulzmann2007}, which is a smaller, typed, functional language. This \emph{Core} language is relatively easy to process compared to the larger Haskell language. A description in \emph{Core} can still contain elements which have no direct translation to hardware, such as polymorphic types and function-valued arguments. Such a description needs to be transformed to a \emph{normal form}, which only contains elements that have a direct translation. The second stage of the compiler, the \emph{normalization} phase, 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 and lambda calculus~\cite{lambdacalculus}, such as $\beta$-reduction and $\eta$-expansion. It also includes self-defined transformations that are responsible for the reduction of higher-order functions to `regular' first-order functions.