diff --git a/semester4/fmfp/formal-methods-functional-programming-summary.pdf b/semester4/fmfp/formal-methods-functional-programming-summary.pdf
index c44b9e5..adce826 100644
Binary files a/semester4/fmfp/formal-methods-functional-programming-summary.pdf and b/semester4/fmfp/formal-methods-functional-programming-summary.pdf differ
diff --git a/semester4/fmfp/parts/03_typing/03_interpreter/01_read.tex b/semester4/fmfp/parts/03_typing/03_interpreter/01_read.tex
index a72e372..ae3616a 100644
--- a/semester4/fmfp/parts/03_typing/03_interpreter/01_read.tex
+++ b/semester4/fmfp/parts/03_typing/03_interpreter/01_read.tex
@@ -49,4 +49,4 @@ We can use for example these parser combinators:
 \inputcode{haskell}{code/10_parser.hs}
 
 These are just some of the functions defined.
-You can find a full mini-haskell and lambda-calculus parser on CodeExpert (at the time of writing this that was the case at least)
+You can find a full mini-haskell and lambda-calculus parser on CodeExpert (at the time of writing that was the case at least)