X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=top%2Flang.tex;h=1b5735d53581345309b328eca64dfa18abebec54;hb=7af43f4cbbc7792ec22553a84468cde77f429a11;hp=0d2f3abafe4eff245408fcf5e34cc9429c671f4a;hpb=adcda9a326216c71bcc240dfc6882f95b183b102;p=phd-thesis.git

diff --git a/top/lang.tex b/top/lang.tex
index 0d2f3ab..1b5735d 100644
--- a/top/lang.tex
+++ b/top/lang.tex
@@ -326,7 +326,6 @@ Creating tasks is done by evaluating expressions.
 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.
@@ -688,7 +687,6 @@ The language is an enriched lambda calculus as a host language.
 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}