You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/algorithms.tex
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -24,7 +24,7 @@
24
24
\end{note}
25
25
26
26
\pnum
27
-
An evaluation A is ordered before an evaluation B if A is
27
+
An evaluation A is \defn{ordered before} an evaluation B if A is
28
28
deterministically sequenced before B. \begin{note}If A is indeterminately
29
29
sequenced with respect to B or A and B are unsequenced, then A is not ordered
30
30
before B and B is not ordered before A. The ordered before relationship is
@@ -75,7 +75,7 @@
75
75
\begin{note}\term{Horizontally matched} establishes a theoretical {\em lock-step} relationship between evaluations in different applications of an element access function.\end{note}
76
76
77
77
\pnum
78
-
Let $f$ be a function called for each argument list in a sequence of argument lists. \defn{Wavefront application of f} requires that evaluation A\textsubscript{i} be sequenced before evaluation B\textsubscript{j} if i < j and:
78
+
Let $f$ be a function called for each argument list in a sequence of argument lists. \defn{Wavefront application} of $f$ requires that evaluation A\textsubscript{i} be sequenced before evaluation B\textsubscript{j} if i < j and:
79
79
80
80
\begin{itemize}
81
81
\item A\textsubscript{i} is sequenced before some evaluation B\textsubscript{i} and B\textsubscript{i} is horizontally matched with B\textsubscript{j}, or
0 commit comments