| 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-- |
| s1210629013@55404 | 1 |
\chapter{Fundamentals}
|
| s1210629013@55404 | 2 |
\label{cha:fundamentals}
|
| s1210629013@55404 | 3 |
|
| s1210629013@55404 | 4 |
\section{Functional Programming}
|
| s1210629013@55404 | 5 |
\label{sec:funprog}
|
| s1210629013@55404 | 6 |
about 2 pages\\ |
| s1210629013@55404 | 7 |
NOTES:\\ |
| s1210629013@55404 | 8 |
declarative programming, mathematical notation: close to formal specification -> prototyping\\ |
| s1210629013@55404 | 9 |
clean\_parallel\_graph\_rewriting.pdf: lambda calculus vs. graph rewriting systems.\\ |
| s1210629013@55404 | 10 |
impure vs. pure\\ |
| s1210629013@55404 | 11 |
monads vs. linear type systems\\ |
| s1210629013@55404 | 12 |
Hindley–Milner type inference |
| s1210629013@55404 | 13 |
|
| s1210629013@55404 | 14 |
\subsection{History}
|
| s1210629013@55404 | 15 |
text |
| s1210629013@55404 | 16 |
|
| s1210629013@55404 | 17 |
\subsection{Common Features}
|
| s1210629013@55404 | 18 |
text |
| s1210629013@55404 | 19 |
|
| s1210629013@55404 | 20 |
|
| s1210629013@55404 | 21 |
\section{Computer Theorem Proving}
|
| s1210629013@55404 | 22 |
\label{sec:ctp}
|
| s1210629013@55404 | 23 |
about 1 page |
| s1210629013@55404 | 24 |
|
| s1210629013@55404 | 25 |
|
| s1210629013@55404 | 26 |
\section{Parallelism}
|
| s1210629013@55404 | 27 |
\label{sec:parallelism}
|
| s1210629013@55404 | 28 |
|
| s1210629013@55404 | 29 |
\subsection{Gain, Cost and Limits}
|
| s1210629013@55404 | 30 |
about 1 page |
| s1210629013@55404 | 31 |
|
| s1210629013@55404 | 32 |
\subsection{Multicore Processors}
|
| s1210629013@55404 | 33 |
about 1 page\\ |
| s1210629013@55404 | 34 |
NOTES:\\ |
| s1210629013@55404 | 35 |
hyper threading |
| s1210629013@55404 | 36 |
|
| s1210629013@55404 | 37 |
\subsection{Operating Systems}
|
| s1210629013@55404 | 38 |
about 1 page\\ |
| s1210629013@55404 | 39 |
NOTES:\\ |
| s1210629013@55404 | 40 |
I/O, streams! |
| s1210629013@55404 | 41 |
|
| s1210629013@55404 | 42 |
\subsection{Functional Programming}
|
| s1210629013@55404 | 43 |
about 1 page |
| s1210629013@55404 | 44 |
|
| s1210629013@55404 | 45 |
|
| s1210629013@55404 | 46 |
\section{Concurrency and Responsiveness}
|
| s1210629013@55404 | 47 |
\label{sec:concurresp}
|
| s1210629013@55404 | 48 |
about 1/2 page |
| s1210629013@55404 | 49 |
|
| s1210629013@55404 | 50 |
|
| s1210629013@55404 | 51 |
\section{Refactoring Functional Programs}
|
| s1210629013@55404 | 52 |
\label{sec:refacfunprogs}
|
| s1210629013@55404 | 53 |
about 2 pages |
| s1210629013@55404 | 54 |