The result of an evaluated task expression is called a task tree, a run time representation of a task.
In order to evaluate a task, the resulting task tree is \emph{rewritten}, i.e.\ similar to rewrite systems, they perform a bit of work, step by step.
With each step, a task value is yielded that is observable by other tasks and can be acted upon.
-\todo{dui\-de\-lijk ge\-noeg?}
The implementation in the \gls{MTASK} \gls{RTS} for task execution is shown in \cref{chp:implementation}.
The following sections show the definitions of the functions for creating tasks.
It provides language constructs for arithmetic expressions, conditionals, functions, but also non-interactive basic tasks, task combinators, peripheral support, and integration with \gls{ITASK}.
Terms in the language are just interfaces and can be interpreted by one or more interpretations.
The most important interpretation of the language is the byte code compiler.
-\todo{Uit\-brei\-den?}
\input{subfilepostamble}
\end{document}
repositories / phd-thesis.git / blobdiff