Explicitely use "letrec" for recursive lets.

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

diff --git a/Chapters/Prototype.tex b/Chapters/Prototype.tex
index e11788611fa6ab3ae827c3fd13a69602415d4368..85e7fb2816ffb04aeb898b4ffebb5e36cd23fac4 100644 (file)
--- a/Chapters/Prototype.tex
+++ b/Chapters/Prototype.tex
@@ -50,6 +50,9 @@
 
     TODO: Was Haskell really a good choice? Perhaps say this somewhere else?
 
+    \subsection{Output language or format}
+        VHDL / Verilog / EDIF etc. Why VHDL?
+
   \section{Prototype design}
     As stated above, we will use the Glasgow Haskell Compiler (\small{GHC}) to
     implement our prototype compiler. To understand the design of the
@@ -303,7 +306,7 @@ let bndr = value in body
     \stopdesc
     \startdesc{Recursive let expression}
 \startlambda
-let 
+letrec
   bndr1 = value1
   \vdots
   bndrn = valuen
@@ -710,9 +713,8 @@ fstint = λa.λb.fst @Int @Int a b
           \subsection[sec:prototype:separate]{Separate compilation}
           - Simplified core?
 
-        Haskell language coverage / constraints
-                Recursion
-                Builtin types
-                Custom types (Sum types, product types)
-                Function types / higher order expressions
-
+  \section{Haskell language coverage and constraints}
+    Recursion
+    Builtin types
+    Custom types (Sum types, product types)
+    Function types / higher order expressions