2 \label{cha:fundamentals}
4 \section{Functional Programming}
8 declarative programming, mathematical notation: close to formal specification -> prototyping\\
9 clean\_parallel\_graph\_rewriting.pdf: lambda calculus vs. graph rewriting systems.\\
11 monads vs. linear type systems\\
12 Hindley–Milner type inference
17 \subsection{Common Features}
21 \section{Computer Theorem Proving}
27 \label{sec:parallelism}
29 \subsection{Gain, Cost and Limits}
32 \subsection{Multicore Processors}
37 \subsection{Operating Systems}
42 \subsection{Functional Programming}
46 \section{Concurrency and Responsiveness}
47 \label{sec:concurresp}
51 \section{Refactoring Functional Programs}
52 \label{sec:refacfunprogs}