[FMFP] Final remarks and fixes

semester4/fmfp/parts/06_exercises/01_fp/00_eval-strats.tex

@@ -1,6 +1,6 @@
 \subsubsection{Evaluation strategies}
 \begin{examdetails}
-    It is likely that one such task will appear.
+    It is not very likely that one such task will appear.
 \end{examdetails}
 Evaluation strategies formalize how programming languages evaluate the code.
 Most of the commonly used programming languages use \textit{eager evaluation}, whereas functional programming languages tend to prefer \textit{lazy evaluation}

semester4/fmfp/parts/06_exercises/01_fp/01_haskell.tex

@@ -1,6 +1,6 @@
 \subsubsection{Haskell}
 \begin{examdetails}
-    typically either short coding task or proof of program
+    Typically one large coding task (split up into many subtasks) and proof of program
 \end{examdetails}
 
 \paragraph{Programming}

semester4/fmfp/parts/06_exercises/01_fp/02_natural-deduction.tex

@@ -1,5 +1,8 @@
 \newpage
 \subsubsection{Natural Deduction}
+\begin{examdetails}
+    From time to time there is one such task, has become more common in recent times. Inference rules are provided
+\end{examdetails}
 \paragraph{Parenthesis}
 This task (if it were to even ever appear in the exams) is simply applying precedences, as well as remembering associativity.
 The precedences are as follows:

semester4/fmfp/parts/06_exercises/01_fp/03_type-inference.tex

@@ -2,6 +2,7 @@
 \begin{examdetails}
     There typically is one such task. They provide the inference rules
 \end{examdetails}
+
 The proof trees are again drawn up bottom up, applying rules from the outside in.
 \begin{enumerate}
     \item Create a proof tree using the typing rules.