diff --git a/semester4/fmfp/formal-methods-functional-programming-summary.pdf b/semester4/fmfp/formal-methods-functional-programming-summary.pdf index 3dc6191..81cdf04 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/00_haskell/01_syntax.tex b/semester4/fmfp/parts/00_haskell/01_syntax.tex index bbad742..806b627 100644 --- a/semester4/fmfp/parts/00_haskell/01_syntax.tex +++ b/semester4/fmfp/parts/00_haskell/01_syntax.tex @@ -10,3 +10,7 @@ For integers the following functions are available: Normal arithmetic operations To use prefix notation on non-alphanumeric function names, wrap them in parenthesis like this: \texttt{(+) x z}. Using \texttt{+ x z} does not work. We can use the normal comparison operators that return a boolean on evaluation. \bi{Booleans} are \texttt{True} and \texttt{False} + + +\subsection{Book} +Since the Haskell Book recommended by the lecture is concise and really great, we recommend reading that book. diff --git a/semester4/fmfp/parts/01_induction-proofs/06_induction-on-derivation-sequence.tex b/semester4/fmfp/parts/01_induction-proofs/06_induction-on-derivation-sequence.tex index 2f320b5..adbe643 100644 --- a/semester4/fmfp/parts/01_induction-proofs/06_induction-on-derivation-sequence.tex +++ b/semester4/fmfp/parts/01_induction-proofs/06_induction-on-derivation-sequence.tex @@ -1,4 +1,3 @@ -\newpage \subsection{Induction on Derivation Sequence} A finite derivation sequence has a length $n \in \N$. We typically reason about finite derivation sequences using \bi{strong induction on the length of a derivation sequence}, diff --git a/semester4/fmfp/parts/01_induction-proofs/08_cyp.tex b/semester4/fmfp/parts/01_induction-proofs/08_cyp.tex index 16fc759..ac2d7b6 100644 --- a/semester4/fmfp/parts/01_induction-proofs/08_cyp.tex +++ b/semester4/fmfp/parts/01_induction-proofs/08_cyp.tex @@ -1,3 +1,4 @@ +\newpage \subsection{Proofs using CYP syntax} \label{sec:cyp} Using CYP (Check Your Proof) syntax is allowed at the exams and can be a bit less to write depending on your writing style.