1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/doc-isac/mlehnfeld/master/thesis/fundamentals.tex	Wed Mar 12 17:43:22 2014 +0100
     1.3 @@ -0,0 +1,54 @@
     1.4 +\chapter{Fundamentals}
     1.5 +\label{cha:fundamentals}
     1.6 +
     1.7 +\section{Functional Programming}
     1.8 +\label{sec:funprog}
     1.9 +about 2 pages\\
    1.10 +NOTES:\\
    1.11 +declarative programming, mathematical notation: close to formal specification -> prototyping\\
    1.12 +clean\_parallel\_graph\_rewriting.pdf: lambda calculus vs. graph rewriting systems.\\
    1.13 +impure vs. pure\\
    1.14 +monads vs. linear type systems\\
    1.15 +Hindley–Milner type inference
    1.16 +
    1.17 +\subsection{History}
    1.18 +text
    1.19 +
    1.20 +\subsection{Common Features}
    1.21 +text
    1.22 +
    1.23 +
    1.24 +\section{Computer Theorem Proving}
    1.25 +\label{sec:ctp}
    1.26 +about 1 page
    1.27 +
    1.28 +
    1.29 +\section{Parallelism}
    1.30 +\label{sec:parallelism}
    1.31 +
    1.32 +\subsection{Gain, Cost and Limits}
    1.33 +about 1 page
    1.34 +
    1.35 +\subsection{Multicore Processors}
    1.36 +about 1 page\\
    1.37 +NOTES:\\
    1.38 +hyper threading
    1.39 +
    1.40 +\subsection{Operating Systems}
    1.41 +about 1 page\\
    1.42 +NOTES:\\
    1.43 +I/O, streams!
    1.44 +
    1.45 +\subsection{Functional Programming}
    1.46 +about 1 page
    1.47 +
    1.48 +
    1.49 +\section{Concurrency and Responsiveness}
    1.50 +\label{sec:concurresp}
    1.51 +about 1/2 page
    1.52 +
    1.53 +
    1.54 +\section{Refactoring Functional Programs}
    1.55 +\label{sec:refacfunprogs}
    1.56 +about 2 pages
    1.57 +