add stuff about assignments, class implementation etc

[msc-thesis1617.git] / methods.top.tex

diff --git a/methods.top.tex b/methods.top.tex
index e29f16d..cb951a1 100644 (file)
--- a/methods.top.tex
+++ b/methods.top.tex
@@ -27,7 +27,7 @@ image all fields are entered and the \CI{TaskValue} transitions to the
        \caption{The states of a \CI{TaskValue}}\label{fig:taskvalue}
 \end{figure}
 
-\begin{lstlisting}[language=Clean,label={lst:taskex},%
+\begin{lstlisting}[label={lst:taskex},%
        caption={An example \gls{Task} for entering a name}]
 :: Name = { firstname :: String
           , lastname  :: String
@@ -67,6 +67,7 @@ specialization instances for these functions and show an according interface.
 Generated interfaces can be modified with decoration operators.
 
 \section{Combinators}
+\todo{check and refine}
 \Glspl{Task} can be combined using so called \gls{Task}-combinators.
 Combinators describe relations between \glspl{Task}. \Glspl{Task} can be
 combined in parallel, sequenced and their result values can be converted to
@@ -99,7 +100,7 @@ Listing~\ref{lst:combinators}.
                dictates.
 \end{itemize}
 
-\begin{lstlisting}[language=Clean,%
+\begin{lstlisting}[%
        caption={\Gls{Task}-combinators},label={lst:combinators}]
 //Step combinator
 (>>*)  infixl 1 :: (Task a) [TaskCont a (Task b)] -> Task b     | iTask a & iTask b
@@ -133,7 +134,7 @@ operations are atomic in the sense that during reading no other tasks are
 executed.
 
 \begin{lstlisting}[%
-       language=Clean,label={lst:shares},caption={\Gls{SDS} functions}]
+       label={lst:shares},caption={\Gls{SDS} functions}]
 get ::          (ReadWriteShared r w)           -> Task r | iTask r
 set :: w        (ReadWriteShared r w)           -> Task w | iTask w
 upd :: (r -> w) (ReadWriteShared r w)           -> Task w | iTask r & iTask w