X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=methods.top.tex;h=c479f49de14249f3df57aed0fd6c97d89181f698;hb=d118ff9d857683084065145df45135ef6fa06711;hp=bc940034f96fa504108217928d8d97f1ea932323;hpb=c1a2d537de7ff3d730d26658daa822b2f03ea110;p=msc-thesis1617.git

diff --git a/methods.top.tex b/methods.top.tex
index bc94003..c479f49 100644
--- a/methods.top.tex
+++ b/methods.top.tex
@@ -1,5 +1,4 @@
-\section{\acrlong{TOP}}
-\subsection{\gls{iTasks}}
+\section{iTasks}
 \gls{TOP} is a recent programming paradigm implemented as
 \gls{iTasks}\cite{achten_introduction_2015} in the pure lazy functional
 language \gls{Clean}\cite{brus_cleanlanguage_1987}. \gls{iTasks} is a
@@ -66,7 +65,7 @@ functions that are captured in the class \CI{iTask}. Basic types have
 specialization instances for these functions and show an according interface.
 Generated interfaces can be modified with decoration operators.
 
-\subsection{Combinators}
+\section{Combinators}
 \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
@@ -117,7 +116,7 @@ basic combinators are shown in Listing~\ref{lst:combinators}.
 (-&&-) infixr 4 :: (Task a) (Task b)              -> Task (a,b) | iTask a & iTask b
 \end{lstlisting}
 
-\subsection{\acrlongpl{SDS}}
+\section{\acrlongpl{SDS}}
 \Glspl{SDS} are an abstraction over resources that are available in the world
 or in the \gls{iTasks} system. The shared data can be a file on disk, it can be
 the time, a random integer or just some data stored in memory. The actual