X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Chapters%2FFuture.tex;h=9c7bb51ec5cdfe2b1444d2d9aed1f182b942a1df;hp=d395586754892afbfc0539fb2da846a6975a2bd5;hb=313351372e8c609c2875902d9c9a2b89f7c97032;hpb=ecb1b7d79982a225260129766fb3c97a62bd22e1

diff --git a/Chapters/Future.tex b/Chapters/Future.tex
index d395586..9c7bb51 100644
--- a/Chapters/Future.tex
+++ b/Chapters/Future.tex
@@ -587,7 +587,7 @@ higher-order value at the spot where it is applied, and thus the higher-order
 value disappears.
 
 This approach is commonly known as the \quote{Reynolds approach to
-defuntionalization}, first described by J.C. Reynolds \cite[reynolds98] and
+defuntionalization}, first described by J.C. Reynolds \cite[reynolds98]\ and
 seems to apply well to this situation. One note here is that Reynolds'
 approach puts all the higher-order values in a single datatype. For a typed
 language, we will at least have to have a single datatype for each function