X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Chapters%2FPrototype.tex;h=e2e5db7f0581a1d01315e683396dab6c942a66ac;hp=390e98b57c39dc0a1da114a812bd4e8272d1967a;hb=14ba857230ddd3bed3e9fbdde81ad2f693488493;hpb=391f3ab5a3e21567b1b1b62b1c7ed47fcdb40886

diff --git a/Chapters/Prototype.tex b/Chapters/Prototype.tex
index 390e98b..e2e5db7 100644
--- a/Chapters/Prototype.tex
+++ b/Chapters/Prototype.tex
@@ -49,7 +49,7 @@
     }
     Considering that we required a prototype which should be working quickly,
     and that implementing parsers, semantic checkers and especially
-    typcheckers is not exactly the core of this research (but it is lots and
+    typcheckers is not exactly the Core of this research (but it is lots and
     lots of work!), using an existing language is the obvious choice. This
     also has the advantage that a large set of language features is available
     to experiment with and it is easy to find which features apply well and
@@ -220,7 +220,7 @@
     Assuming that we do not want to deal with (or modify) parsing, typechecking
     and other frontend business and that native code is not really a useful
     format anymore, we are left with the choice between the full Haskell
-    \small{AST}, or the smaller (simplified) core representation.
+    \small{AST}, or the smaller (simplified) Core representation.
 
     The advantage of taking the full \small{AST} is that the exact structure
     of the source program is preserved. We can see exactly what the hardware
@@ -228,15 +228,15 @@
     the full \small{AST} is a very complicated datastructure. If we are to
     handle everything it offers, we will quickly get a big compiler.
 
-    Using the core representation gives us a much more compact datastructure
-    (a core expression only uses 9 constructors). Note that this does not mean
-    that the core representation itself is smaller, on the contrary.
-    Since the core language has less constructs, most Core expressions
+    Using the Core representation gives us a much more compact datastructure
+    (a Core expression only uses 9 constructors). Note that this does not mean
+    that the Core representation itself is smaller, on the contrary.
+    Since the Core language has less constructs, most Core expressions
     are larger than the equivalent versions in Haskell.
 
-    However, the fact that the core language is so much smaller, means it is a
+    However, the fact that the Core language is so much smaller, means it is a
     lot easier to analyze and translate it into something else. For the same
-    reason, \small{GHC} runs its simplifications and optimizations on the core
+    reason, \small{GHC} runs its simplifications and optimizations on the Core
     representation as well \cite[jones96].
 
     We will use the normal Core representation, not the simplified Core. Even
@@ -286,15 +286,15 @@
       translates Haskell sources to a typed Core representation.
     \stopdesc
     \startdesc{Normalization}
-      This is a step that transforms the core representation into a normal
-      form. This normal form is still expressed in the core language, but has
+      This is a step that transforms the Core representation into a normal
+      form. This normal form is still expressed in the Core language, but has
       to adhere to an additional set of constraints. This normal form is less
-      expressive than the full core language (e.g., it can have limited 
+      expressive than the full Core language (e.g., it can have limited 
       higher-order expressions, has a specific structure, etc.), but is
       also very close to directly describing hardware.
     \stopdesc
     \startdesc{\small{VHDL} generation}
-      The last step takes the normal formed core representation and generates
+      The last step takes the normal formed Core representation and generates
       \small{VHDL} for it. Since the normal form has a specific, hardware-like
       structure, this final step is very straightforward.
     \stopdesc
@@ -312,7 +312,7 @@
     any functions used by the entry functions (recursively).
     
   \section[sec:prototype:core]{The Core language}
-    \defreftxt{core}{the Core language}
+    \defreftxt{Core}{the Core language}
     Most of the prototype deals with handling the program in the Core
     language. In this section we will show what this language looks like and
     how it works.
@@ -383,7 +383,7 @@
       for normal function \quote{calls}, but also for applying type
       abstractions and data constructors.
 
-      In core, there is no distinction between an operator and a
+      In Core, there is no distinction between an operator and a
       function. This means that, for example the addition of two numbers
       looks like the following in Core:
       
@@ -626,7 +626,7 @@
 
     \startdesc{Note}
       The Core language in \small{GHC} allows adding \emph{notes}, which serve
-      as hints to the inliner or add custom (string) annotations to a core
+      as hints to the inliner or add custom (string) annotations to a Core
       expression. These should not be generated normally, so these are not
       handled in any way in the prototype.
     \stopdesc
@@ -698,7 +698,7 @@
       (though you could of course construct invalidly typed expressions
       through the \GHC\ API).
 
-      Any type in core is one of the following:
+      Any type in Core is one of the following:
 
       \startdesc{A type variable}
         \startlambda