X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=top%2Flang.tex;h=cf245de03a1881bbb5695f08c981327f3bd46d56;hb=b8ed2f5d652345859c8cb9daf48116a2c1a32c48;hp=5b7fddca608e7e60c5802c18544ea90bea137ada;hpb=12eedfefd66f1bab5e8b3b76432ea1efc145ce02;p=phd-thesis.git

diff --git a/top/lang.tex b/top/lang.tex
index 5b7fddc..cf245de 100644
--- a/top/lang.tex
+++ b/top/lang.tex
@@ -328,7 +328,7 @@ This section describes the task language of \gls{MTASK}.
 Tasks represent abstract pieces of work and can be combined using combinators.
 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.
+In order to evaluate a task, the resulting task tree is \emph{rewritten} using small-step reduction, 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.
 
 The implementation in the \gls{MTASK} \gls{RTS} for task execution is shown in \cref{chp:implementation}.