[FMFP] Exam notes for FP almost complete

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

@@ -1,4 +1,13 @@
 \subsubsection{Type Inference}
+\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 
+    \item Create a proof tree using the typing rules.
+    \item During the proof, keep track of what the applications of rules tell us about types in a list.
+    \item After reaching leafs in the prooftree, resolve the types by inserting the now known types into the types you kept in the list.
 \end{enumerate}
+Remember that not all expressions are typeable, so if you end up getting an invalid tree or a conflict of types, this is very much possible.
+
+To prove that the type of an expression is correct, we can simply draw up a type derivation tree, using the typing rules from Section~\ref{sec:mini-haskell}.

semester4/fmfp/parts/06_exercises/02_fm/00_imp.tex

@@ -0,0 +1 @@
+\subsubsection{IMP}

semester4/fmfp/parts/06_exercises/02_fm/01_operational-semantics.tex

@@ -0,0 +1,5 @@
+\subsubsection{Operational Semantics}
+\paragraph{Big Step Semantics}
+
+
+\paragraph{Small Step Semantics}

semester4/fmfp/parts/06_exercises/02_fm/02_axiomatic-semantics.tex

@@ -0,0 +1 @@
+\subsubsection{Axiomatic Semantics}

semester4/fmfp/parts/06_exercises/02_fm/03_modelling.tex

@@ -0,0 +1 @@
+\subsubsection{Modelling}

semester4/fmfp/parts/06_exercises/02_fm/04_ltl.tex

@@ -0,0 +1 @@
+\subsubsection{Linear Time Properties (LTL)}