-The implementation for the sequence combinator is called the
-\CI{step} (\CI{>>*}). This combinator runs the left-hand \gls{Task} and
-starts the right-hand side when a certain predicate holds. Predicates
-can be propositions about the \CI{TaskValue}, user actions from within
-the web browser or a thrown exception. The familiar
-bind-combinator is an example of a sequence combinator. This combinator
-runs the left-hand side and continues to the right-hand \gls{Task} if
-there is an \CI{UnStable} value and the user presses continue or when
-the value is \CI{Stable}. The combinator could have been implemented
-as follows:
+The implementation for the sequence combinator is called the \CI{step}
+(\CI{>>*}). This combinator runs the left-hand \gls{Task} and starts the
+right-hand side when a certain predicate holds. Predicates can be propositions
+about the \CI{TaskValue}, user actions from within the web browser or a thrown
+exception. The familiar bind-combinator is an example of a sequence combinator.
+This combinator runs the left-hand side and continues to the right-hand
+\gls{Task} if there is an \CI{UnStable} value and the user presses continue or
+when the value is \CI{Stable}. The combinator could have been implemented as
+follows: