doc-isac/mlehnfeld/master/thesis/fundamentals.tex
author Mathias Lehnfeld <s1210629013@students.fh-hagenberg.at>
Wed, 12 Mar 2014 17:43:22 +0100
changeset 55404 ab97437e021a
child 55466 55c2d2ee3f92
permissions -rw-r--r--
mathias lehnfeld master thesis latex files added
     1 \chapter{Fundamentals}
     2 \label{cha:fundamentals}
     3 
     4 \section{Functional Programming}
     5 \label{sec:funprog}
     6 about 2 pages\\
     7 NOTES:\\
     8 declarative programming, mathematical notation: close to formal specification -> prototyping\\
     9 clean\_parallel\_graph\_rewriting.pdf: lambda calculus vs. graph rewriting systems.\\
    10 impure vs. pure\\
    11 monads vs. linear type systems\\
    12 Hindley–Milner type inference
    13 
    14 \subsection{History}
    15 text
    16 
    17 \subsection{Common Features}
    18 text
    19 
    20 
    21 \section{Computer Theorem Proving}
    22 \label{sec:ctp}
    23 about 1 page
    24 
    25 
    26 \section{Parallelism}
    27 \label{sec:parallelism}
    28 
    29 \subsection{Gain, Cost and Limits}
    30 about 1 page
    31 
    32 \subsection{Multicore Processors}
    33 about 1 page\\
    34 NOTES:\\
    35 hyper threading
    36 
    37 \subsection{Operating Systems}
    38 about 1 page\\
    39 NOTES:\\
    40 I/O, streams!
    41 
    42 \subsection{Functional Programming}
    43 about 1 page
    44 
    45 
    46 \section{Concurrency and Responsiveness}
    47 \label{sec:concurresp}
    48 about 1/2 page
    49 
    50 
    51 \section{Refactoring Functional Programs}
    52 \label{sec:refacfunprogs}
    53 about 2 pages
    54