Memoize and order the computation in the integration time points using
the discrete interpolation. It consumes less memory than the memo
function but it is not aware of the Runge-Kutta method. There is a subtle
difference when we request for values in the intermediate time points
that are used by this method to integrate. In general case you should
prefer the memo0 function above memo.

Iterating

Iterate sequentially the dynamic process with side effects in
the integration time points. It is equivalent to a call of the
memo0 function but significantly more efficient, for the array
is not created.

Fold

Like the standard foldl1 function but applied to values in
the integration time points. The accumulator values are transformed
according to the first argument, which should be either function
memo0 or umemo0.

Like the standard foldl function but applied to values in
the integration time points. The accumulator values are transformed
according to the first argument, which should be either function
memo0 or umemo0.