Fix / remove some final todos.

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

diff --git a/Chapters/HardwareDescription.tex b/Chapters/HardwareDescription.tex
index 407559f7f5e83e330e3bde7a81bde6c120eea7a9..f56723c1dd4c46e37495502304c2ece6dc15ed13 100644 (file)
--- a/Chapters/HardwareDescription.tex
+++ b/Chapters/HardwareDescription.tex
@@ -1029,7 +1029,7 @@ acc in s = (s', out)
         \todo{Example}
     
       \subsubsection{Which arguments and results are stateful?}
-        \fxnote{This section should get some examples}
+        \todo{This section should get some examples}
         We need some way to know which arguments should become input ports and
         which argument(s?) should become the current state (\eg, be bound to
         the register outputs). This does not hold just for the top
@@ -1210,7 +1210,7 @@ acc in s = (s', out)
   the type checker to always type-check both alternatives, which cannot be
   done. The type-checker is unable to distinguish the two case
   alternatives (this is partly possible using \small{GADT}s, but that
-  approach faced other problems \todo{ref christiaan?}).
+  approach faced other problems \cite[baaij09]). 
 
   This is a fundamental problem, that would seem perfectly suited for a
   type class.  Considering that we need to switch between to
@@ -1220,8 +1220,6 @@ acc in s = (s', out)
   them that you need to define a new type class for every recursive
   function you want to define).
 
-  \todo{This should reference Christiaan}
-
   \subsection{General recursion}
   Of course there are other forms of recursion, that do not depend on the
   length (and thus type) of a list. For example, simple recursion using a