s1210629013@55404: \chapter{Fundamentals}
s1210629013@55404: \label{cha:fundamentals}
s1210629013@55404: 
s1210629013@55404: \section{Functional Programming}
s1210629013@55404: \label{sec:funprog}
s1210629013@55404: about 2 pages\\
s1210629013@55404: NOTES:\\
s1210629013@55404: declarative programming, mathematical notation: close to formal specification -> prototyping\\
s1210629013@55404: clean\_parallel\_graph\_rewriting.pdf: lambda calculus vs. graph rewriting systems.\\
s1210629013@55404: impure vs. pure\\
s1210629013@55404: monads vs. linear type systems\\
s1210629013@55404: Hindley–Milner type inference
s1210629013@55404: 
s1210629013@55404: \subsection{History}
s1210629013@55404: text
s1210629013@55404: 
s1210629013@55404: \subsection{Common Features}
s1210629013@55404: text
s1210629013@55404: 
s1210629013@55404: 
s1210629013@55404: \section{Computer Theorem Proving}
s1210629013@55404: \label{sec:ctp}
s1210629013@55404: about 1 page
s1210629013@55404: 
s1210629013@55404: 
s1210629013@55404: \section{Parallelism}
s1210629013@55404: \label{sec:parallelism}
s1210629013@55404: 
s1210629013@55404: \subsection{Gain, Cost and Limits}
s1210629013@55404: about 1 page
s1210629013@55404: 
s1210629013@55404: \subsection{Multicore Processors}
s1210629013@55404: about 1 page\\
s1210629013@55404: NOTES:\\
s1210629013@55404: hyper threading
s1210629013@55404: 
s1210629013@55404: \subsection{Operating Systems}
s1210629013@55404: about 1 page\\
s1210629013@55404: NOTES:\\
s1210629013@55404: I/O, streams!
s1210629013@55404: 
s1210629013@55404: \subsection{Functional Programming}
s1210629013@55404: about 1 page
s1210629013@55404: 
s1210629013@55404: 
s1210629013@55404: \section{Concurrency and Responsiveness}
s1210629013@55404: \label{sec:concurresp}
s1210629013@55404: about 1/2 page
s1210629013@55404: 
s1210629013@55404: 
s1210629013@55404: \section{Refactoring Functional Programs}
s1210629013@55404: \label{sec:refacfunprogs}
s1210629013@55404: about 2 pages
s1210629013@55404: