Add pronounciation of Cλash.

[matthijs/master-project/report.git] / Chapters / Introduction.tex

diff --git a/Chapters/Introduction.tex b/Chapters/Introduction.tex
index 3b0a5c1ec9c2723f0968ea0956766d563389f958..18950802c16f31fd2f6f33036e7076218389c436 100644 (file)
--- a/Chapters/Introduction.tex
+++ b/Chapters/Introduction.tex
@@ -7,10 +7,10 @@ connect these worlds and puts a step towards making hardware programming
 on the whole easier, more maintainable and generally more pleasant.
 
 This assignment has been performed in close cooperation with Christiaan
 on the whole easier, more maintainable and generally more pleasant.
 
 This assignment has been performed in close cooperation with Christiaan

-Baaij, whose Master's thesis \cite[baaij09] has been completed at the
+Baaij, whose Master's thesis \cite[baaij09]\ has been completed at the

 same time as this thesis. Where this thesis focuses on the
 interpretation of the Haskell language and the compilation process,
 same time as this thesis. Where this thesis focuses on the
 interpretation of the Haskell language and the compilation process,

-\cite[baaij09] has a more thorough study of the field, explores more
+\cite[baaij09]\ has a more thorough study of the field, explores more

 advanced types and provides a case study.
 
 % Use \subject to hide this section from the toc
 advanced types and provides a case study.
 
 % Use \subject to hide this section from the toc


@@ -72,7 +72,7 @@ advanced types and provides a case study.
     \stopcombination
 
   Slightly more complicated is the incremental summation of
     \stopcombination
 
   Slightly more complicated is the incremental summation of

-  values show in \in{example}[ex:RecursiveSum]\note[notfinalsyntax].
+  values shown in \in{example}[ex:RecursiveSum]\note[notfinalsyntax].

 
   In this example we see a recursive function \hs{sum'} that recurses over a
   list and takes an accumulator argument that stores the sum so far. On each
 
   In this example we see a recursive function \hs{sum'} that recurses over a
   list and takes an accumulator argument that stores the sum so far. On each


@@ -236,6 +236,8 @@ advanced types and provides a case study.
     Systems). The lambda in the name is of course a reference to the
     lambda abstraction, which is an essential element of most functional
     languages (and is also prominent in the Haskell logo).
     Systems). The lambda in the name is of course a reference to the
     lambda abstraction, which is an essential element of most functional
     languages (and is also prominent in the Haskell logo).

+
+    Cλash is pronounced like \quote{Clash}.

     \stopframedtext
   }
 
     \stopframedtext
   }
 


@@ -252,7 +254,7 @@ programming. Since we are not the first to have merged these approaches,
 a number of other functional hardware description languages are briefly
 described.
 
 a number of other functional hardware description languages are briefly
 described.
 

-Chapter two describes the exploratory part of this research: How can we
+Chapter two describes the exploratory part of this research: how can we

 describe hardware using a functional language and how can we use functional
 concepts for hardware descriptions?
 
 describe hardware using a functional language and how can we use functional
 concepts for hardware descriptions?