X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Chapters%2FFuture.tex;h=d83f60087c939eb95175c1e9d240a675004d87d8;hp=9495922aa6aeaa8e10b32e1b7342d9b4a7d38af4;hb=7095d53c2ec805554837714da3df3a458ebfb2bb;hpb=93cb2df29b689ea5e28d6192d5ebbd47c2230d05;ds=sidebyside

diff --git a/Chapters/Future.tex b/Chapters/Future.tex
index 9495922..d83f600 100644
--- a/Chapters/Future.tex
+++ b/Chapters/Future.tex
@@ -104,7 +104,7 @@ but can be called explicitely by a hardware description.
 f1 >> f2 = f1 >>= \_ -> f2
 
 (>>=) :: Stateful s1 r1 -> (r1 -> Stateful s2 r2) -> Stateful (s1, s2) r2
-f1 >>= f2 = \\(s1, s2) -> let (s1', r1) = f1 s1
+f1 >>= f2 = \(s1, s2) -> let (s1', r1) = f1 s1
                              (s2', r2) = f2 r1 s2
                          in ((s1', s2'), r2)
                
@@ -241,7 +241,7 @@ transformations to prevent infinite expansion. The main challenge here is how
 to make this set complete, or at least define the constraints on possible
 recursion which guarantee it will work.
 
-TODO: Loop unrolling
+TODO: Reference Christian for loop unrolling
 \stopitemize
 
 \section{Multiple clock domains and asynchronicity}