Index: /reasoner/reasoner.tex
===================================================================
--- /reasoner/reasoner.tex	(revision 142)
+++ /reasoner/reasoner.tex	(revision 143)
@@ -735,5 +735,5 @@
 \end{algorithm}
 %
-The dereferencing operation\footnote{The actual implementation performs the dereferencing when explicitly adding a variable mapping in addition to $\variableMapping$ to the expression substitution visitor.} for Algorithm \ref{algTranslateDerivedDatatypeConstraints} takes a type $t$ and a basis expression $ex$. For each reference base type in the chain of base types, it adds a call of the (internal) IVML dereferencing operation \IVML{refBy} around $ex$ or the recursively built up expression to $ex$. Other types than derived types immediately lead to $ex$ as result.
+The dereferencing operation\footnote{The actual implementation performs the dereferencing in an iterative manner when explicitly adding a variable mapping in addition to $\variableMapping$ to the substitution visitor.} for Algorithm \ref{algTranslateDerivedDatatypeConstraints} takes a type $t$ and a basis expression $ex$. For each reference base type in the chain of base types, it adds a call of the (internal) IVML dereferencing operation \IVML{refBy} around $ex$ or the recursively built up expression to $ex$. Other types than derived types immediately lead to $ex$ as result.
 %
 $$deref(t, ex)=\begin{cases} deref(base(t), ex), & \text{if } isDerived(t) \wedge \neg isReference(base(t)) \\ \IVML{refBy}(deref(base(base(t)), ex)), & \text{if } isDerived(t) \wedge isReference(base(t))\\ ex, & \text{else}\\\end{cases}$$