[FMFP] Fix errors

semester4/fmfp/parts/02_typing/01_mini-haskell/01_lambda-calculus.tex

@@ -1,6 +1,6 @@
 \subsubsection{Lambda calculus}
 To prove that types are correct, the lambda calculus comes in handy.
-It is based on the same concept as natural deduction trees
+The proofs are again structured as derivation trees.
 
 \paragraph{Core rules for Lambda-Calculus}
 \[

semester4/fmfp/parts/02_typing/01_mini-haskell/03_type-inference.tex

@@ -7,7 +7,7 @@ Finally, apply constraints / unification to get possible types.
 
 \paragraph{Self application}
 This means that you apply a function to itself.
-In Haskell, this is not typeable because there would need to be an infinite function type, but all \bi{Haskell types are finite} 
+In Haskell, this is not typeable because there would need to be an infinite function type, but all \bi{Haskell types are finite}
 
 
 \paragraph{Curry-Howard isomorphism}