Link Search Menu Expand Document
\( % cbs-katex.sty % \newcommand{\STYLE}[2]{\htmlClass{cbs-#1}{#2}} \newcommand{\DECL}[3]{\htmlId{#1:#2}{#3}} \newcommand{\REF}[3]{\href{###1:#2}{#3}} \newcommand{\HYPER}[5]{\href{#1/#2/index.html###3:#4}{#5}} % \SHADE{MATH} can be defined to produce a shaded background to highlight % inline MATH in running text: \newcommand{\SHADE}[1]{#1} % \KEY{TEXT}, \STRING{TEXT}, \ATOM{TEXT}, \LEX{TEXT} can be used in math mode: \newcommand{\KEY}[1]{\textsf{\textit{\STYLE{Key}{#1}}}} \newcommand{\STRING}[1]{\textsf{``\texttt{#1}''}} \newcommand{\ATOM}[1]{\textsf{`\texttt{#1}'}} \newcommand{\LEX}[1]{\textsf{\STYLE{Key}{`}\texttt{#1}\STYLE{Key}{'}}} % The following commands produce ASCII characters that are treated specially by LaTeX: \newcommand{\HASH}{\char`\#} \newcommand{\DOLLAR}{\char`\$} \newcommand{\PERCENT}{\char`\%} \newcommand{\AMPERSAND}{\char`\&} \newcommand{\APOSTROPHE}{\char`\'} \newcommand{\BACKSLASH}{\char`\\} \newcommand{\CARET}{\char`\^} \newcommand{\UNDERSCORE}{\char`\_} \newcommand{\GRAVE}{\char`\`} \newcommand{\LEFTBRACE}{\char`\{} \newcommand{\RIGHTBRACE}{\char`\}} \newcommand{\TILDE}{\textasciitilde} % {\char`\~} % \NAME{name} highlights the name; % \NAMEDECL{name} declares Name.name as the target of links to name; % \NAMEREF{name} links name to the target Name.name in the current file; % \NAMEHYPER{url}{file}{name} links name to Name.name at url/file/file.pdf. % Similarly for \VAR{partvariable}, \SYN{syntaxname}, \SEM{semanticsName}, % and \SECT{sectionnumber} % The kerns in \SUB and \VAR avoid overlaps with primes: \newcommand{\SUB}[1]{_{\kern-2mu\STYLE{PartVariable}{\textsf{#1}}}} % PLAIN \newcommand{\VAR}[1]{\STYLE{PartVariable}{\textsf{\textit{#1}\kern2mu}}} \newcommand{\NAME}[1]{\STYLE{Name}{\textsf{#1}}} \newcommand{\SYN}[1]{\STYLE{SyntaxName}{\textsf{#1}}} \newcommand{\SEM}[1]{\STYLE{SemanticsName}{\textsf{#1}}} \newcommand{\SECT}[1]{\STYLE{SectionNumber}{\textsf{#1}}} % DECL \newcommand{\VARDECL}[1]{\DECL{PartVariable}{#1}{\VAR{#1}}} \newcommand{\NAMEDECL}[1]{\DECL{Name}{#1}{\NAME{#1}}} \newcommand{\SYNDECL}[1]{\DECL{SyntaxName}{#1}{\SYN{#1}}} \newcommand{\SEMDECL}[1]{\DECL{SemanticsName}{#1}{\SEM{#1}}} \newcommand{\SECTDECL}[1]{\DECL{SectionNumber}{#1}{\textsf{#1}}} % REF \newcommand{\VARREF}[1]{\REF{PartVariable}{#1}{\VAR{#1}}} \newcommand{\NAMEREF}[1]{\REF{Name}{#1}{\NAME{#1}}} \newcommand{\SYNREF}[1]{\REF{SyntaxName}{#1}{\SYN{#1}}} \newcommand{\SEMREF}[1]{\REF{SemanticsName}{#1}{\SEM{#1}}} \newcommand{\SECTREF}[1]{\REF{SectionNumber}{#1}{\SECT{#1}}} % HYPER \newcommand{\VARHYPER}[3]{\HYPER{#1}{#2}{PartVariable}{#3}{\VAR{#3}}} \newcommand{\NAMEHYPER}[3]{\HYPER{#1}{#2}{Name}{#3}{\NAME{#3}}} \newcommand{\SYNHYPER}[3]{\HYPER{#1}{#2}{SyntaxName}{#3}{\SYN{#3}}} \newcommand{\SEMHYPER}[3]{\HYPER{#1}{#2}{SemanticsName}{#3}{\SEM{#3}}} \newcommand{\SECTHYPER}[3]{\HYPER{#1}{#2}{SectionNumber}{#3}{\SECT{#3}}} % \LEFTPHRASE MATH \RIGHTPHRASE produces [[ MATH ]] with proper brackets: \newcommand{\LEFTPHRASE}{\llbracket} \newcommand{\RIGHTPHRASE}{\rrbracket} % \LEFTGROUP MATH \RIGHTGROUP produces ( MATH ) where the parentheses are % highlighted the same as keywords: \newcommand{\LEFTGROUP}{\STYLE{Key}{(}} \newcommand{\RIGHTGROUP}{\STYLE{Key}{)}} % MATH\PLUS produces a superscript + % MATH\STAR produces a superscript * % MATH\QUERY produces a superscript ? \newcommand{\PLUS}{{}^{\texttt{+}}} \newcommand{\STAR}{{}^{\texttt{*}}} \newcommand{\QUERY}{{}^{\texttt{?}}} % \RULE{& PREMISE \\ & ...}{& FORMULA ... \\ & ...} produces an inference rule % with separately aligned premises and conclusion % PREMISE % ... % ----------- % FORMULA ... % ... \newcommand{\RULE}[2] {\frac{\begin{aligned}#1\end{aligned}}{\begin{aligned}#2\end{aligned}}} % \AXIOM{& FORMULA ... \\ & ...} produces an aligned formula % % FORMULA ... % ... \newcommand{\AXIOM}[1]{\begin{aligned}#1\end{aligned}} % \TO TYPE produces => TYPE \newcommand{\TO}{\mathop{\Rightarrow}} % TERM \TRANS TERM produces TERM ---> TERM \newcommand{\TRANS}{\longrightarrow} % TERM \xrightarrow{LABEL} TERM puts the label above the long arrow % \)

Funcons-beta : Flowing.cbs | PLAIN | PDF

OUTLINE

Flowing

\[\begin{align*} [ \ \KEY{Funcon} \quad & \NAMEREF{left-to-right} \\ \KEY{Alias} \quad & \NAMEREF{l-to-r} \\ \KEY{Funcon} \quad & \NAMEREF{right-to-left} \\ \KEY{Alias} \quad & \NAMEREF{r-to-l} \\ \KEY{Funcon} \quad & \NAMEREF{sequential} \\ \KEY{Alias} \quad & \NAMEREF{seq} \\ \KEY{Funcon} \quad & \NAMEREF{effect} \\ \KEY{Funcon} \quad & \NAMEREF{choice} \\ \KEY{Funcon} \quad & \NAMEREF{if-true-else} \\ \KEY{Alias} \quad & \NAMEREF{if-else} \\ \KEY{Funcon} \quad & \NAMEREF{while-true} \\ \KEY{Alias} \quad & \NAMEREF{while} \\ \KEY{Funcon} \quad & \NAMEREF{do-while-true} \\ \KEY{Alias} \quad & \NAMEREF{do-while} \\ \KEY{Funcon} \quad & \NAMEREF{interleave} \\ \KEY{Datatype} \quad & \NAMEREF{yielding} \\ \KEY{Funcon} \quad & \NAMEREF{signal} \\ \KEY{Funcon} \quad & \NAMEREF{yielded} \\ \KEY{Funcon} \quad & \NAMEREF{yield} \\ \KEY{Funcon} \quad & \NAMEREF{yield-on-value} \\ \KEY{Funcon} \quad & \NAMEREF{yield-on-abrupt} \\ \KEY{Funcon} \quad & \NAMEREF{atomic} \ ] \end{align*}\] \[\begin{align*} \KEY{Meta-variables} \quad & \VAR{T} <: \NAMEHYPER{../../../Values}{Value-Types}{values} \qquad \\& \VAR{T}\STAR <: \NAMEHYPER{../../../Values}{Value-Types}{values}\STAR \end{align*}\]

Sequencing

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{left-to-right}( \_ : ( \TO ( \VAR{T} )\STAR )\STAR) : \TO ( \VAR{T} )\STAR \\ \KEY{Alias} \quad & \NAMEDECL{l-to-r} = \NAMEREF{left-to-right} \end{align*}\]

\(\SHADE{\NAMEREF{left-to-right} ( \cdots )}\) computes its arguments sequentially, from left to right, and gives the resulting sequence of values, provided all terminate normally. For example, \(\SHADE{\NAMEHYPER{../../../Values/Primitive}{Integers}{integer-add} ( \VAR{X}, \VAR{Y} )}\) may interleave the computations of \(\SHADE{\VAR{X}}\) and \(\SHADE{\VAR{Y}}\), whereas \(\SHADE{\NAMEHYPER{../../../Values/Primitive}{Integers}{integer-add} \ \NAMEREF{left-to-right} ( \VAR{X}, \VAR{Y} )}\) always computes \(\SHADE{\VAR{X}}\) before \(\SHADE{\VAR{Y}}\).

When each argument of \(\SHADE{\NAMEREF{left-to-right} ( \cdots )}\) computes a single value, the type of the result is the same as that of the argument sequence. For instance, when \(\SHADE{\VAR{X} : \VAR{T}}\) and \(\SHADE{\VAR{Y} : \VAR{T}'}\), the result of \(\SHADE{\NAMEREF{left-to-right} ( \VAR{X}, \VAR{Y} )}\) is of type \(\SHADE{( \VAR{T}, \VAR{T}' )}\). The only effect of wrapping an argument sequence in \(\SHADE{\NAMEREF{left-to-right} ( \cdots )}\) is to ensure that when the arguments are to be evaluated, it is done in the specified order.

\[\begin{align*} \KEY{Rule} \quad & \RULE{ & \VAR{Y} \TRANS \VAR{Y}' }{ & \NAMEREF{left-to-right} ( \VAR{V}\STAR : ( \VAR{T} )\STAR, \VAR{Y}, \VAR{Z}\STAR ) \TRANS \NAMEREF{left-to-right} ( \VAR{V}\STAR, \VAR{Y}', \VAR{Z}\STAR ) } \\ \KEY{Rule} \quad & \NAMEREF{left-to-right} ( \VAR{V}\STAR : ( \VAR{T} )\STAR ) \leadsto \VAR{V}\STAR \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{right-to-left}( \_ : ( \TO ( \VAR{T} )\STAR )\STAR) : \TO ( \VAR{T} )\STAR \\ \KEY{Alias} \quad & \NAMEDECL{r-to-l} = \NAMEREF{right-to-left} \end{align*}\]

\(\SHADE{\NAMEREF{right-to-left} ( \cdots )}\) computes its arguments sequentially, from right to left, and gives the resulting sequence of values, provided all terminate normally.

Note that \(\SHADE{\NAMEREF{right-to-left} ( \VAR{X}\STAR )}\) and \(\SHADE{\NAMEHYPER{../../../Values/Composite}{Sequences}{reverse} \ \NAMEREF{left-to-right} \ \NAMEHYPER{../../../Values/Composite}{Sequences}{reverse} ( \VAR{X}\STAR )}\) are not equivalent: \(\SHADE{\NAMEHYPER{../../../Values/Composite}{Sequences}{reverse} ( \VAR{X}\STAR )}\) interleaves the evaluation of \(\SHADE{\VAR{X}\STAR}\).

\[\begin{align*} \KEY{Rule} \quad & \RULE{ & \VAR{Y} \TRANS \VAR{Y}' }{ & \NAMEREF{right-to-left} ( \VAR{X}\STAR, \VAR{Y}, \VAR{V}\STAR : ( \VAR{T} )\STAR ) \TRANS \NAMEREF{right-to-left} ( \VAR{X}\STAR, \VAR{Y}', \VAR{V}\STAR ) } \\ \KEY{Rule} \quad & \NAMEREF{right-to-left} ( \VAR{V}\STAR : ( \VAR{T} )\STAR ) \leadsto \VAR{V}\STAR \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{sequential}( \_ : ( \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type} )\STAR, \_ : \TO \VAR{T}) : \TO \VAR{T} \\ \KEY{Alias} \quad & \NAMEDECL{seq} = \NAMEREF{sequential} \end{align*}\]

\(\SHADE{\NAMEREF{sequential} ( \VAR{X}, \cdots )}\) computes its arguments in the given order. On normal termination, it returns the value of the last argument; the other arguments all compute \(\SHADE{\NAMEHYPER{../../../Values/Primitive}{Null}{null-value}}\).

Binary \(\SHADE{\NAMEREF{sequential} ( \VAR{X}, \VAR{Y} )}\) is associative, with unit \(\SHADE{\NAMEHYPER{../../../Values/Primitive}{Null}{null-value}}\).

\[\begin{align*} \KEY{Rule} \quad & \RULE{ & \VAR{X} \TRANS \VAR{X}' }{ & \NAMEREF{sequential} ( \VAR{X}, \VAR{Y}\PLUS ) \TRANS \NAMEREF{sequential} ( \VAR{X}', \VAR{Y}\PLUS ) } \\ \KEY{Rule} \quad & \NAMEREF{sequential} ( \NAMEHYPER{../../../Values/Primitive}{Null}{null-value}, \VAR{Y}\PLUS ) \leadsto \NAMEREF{sequential} ( \VAR{Y}\PLUS ) \\ \KEY{Rule} \quad & \NAMEREF{sequential} ( \VAR{Y} ) \leadsto \VAR{Y} \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{effect}( \VAR{V}\STAR : \VAR{T}\STAR) : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type} \\&\quad \leadsto \NAMEHYPER{../../../Values/Primitive}{Null}{null-value} \end{align*}\]

\(\SHADE{\NAMEREF{effect} ( \cdots )}\) interleaves the computations of its arguments, then discards all the computed values.

Choosing

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{choice}( \_ : ( \TO \VAR{T} )\PLUS) : \TO \VAR{T} \end{align*}\]

\(\SHADE{\NAMEREF{choice} ( \VAR{Y}, \cdots )}\) selects one of its arguments, then computes it. It is associative and commutative.

\[\begin{align*} \KEY{Rule} \quad & \NAMEREF{choice} ( \VAR{X}\STAR, \VAR{Y}, \VAR{Z}\STAR ) \leadsto \VAR{Y} \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{if-true-else}( \_ : \NAMEHYPER{../../../Values/Primitive}{Booleans}{booleans}, \_ : \TO \VAR{T}, \_ : \TO \VAR{T}) : \TO \VAR{T} \\ \KEY{Alias} \quad & \NAMEDECL{if-else} = \NAMEREF{if-true-else} \end{align*}\]

\(\SHADE{\NAMEREF{if-true-else} ( \VAR{B}, \VAR{X}, \VAR{Y} )}\) evaluates \(\SHADE{\VAR{B}}\) to a Boolean value, then reduces to \(\SHADE{\VAR{X}}\) or \(\SHADE{\VAR{Y}}\), depending on the value of \(\SHADE{\VAR{B}}\).

\[\begin{align*} \KEY{Rule} \quad & \NAMEREF{if-true-else} ( \NAMEHYPER{../../../Values/Primitive}{Booleans}{true}, \VAR{X}, \VAR{Y} ) \leadsto \VAR{X} \\ \KEY{Rule} \quad & \NAMEREF{if-true-else} ( \NAMEHYPER{../../../Values/Primitive}{Booleans}{false}, \VAR{X}, \VAR{Y} ) \leadsto \VAR{Y} \end{align*}\]

Iterating

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{while-true}( \VAR{B} : \TO \NAMEHYPER{../../../Values/Primitive}{Booleans}{booleans}, \VAR{X} : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type}) : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type} \\&\quad \leadsto \NAMEREF{if-true-else} ( \VAR{B}, \NAMEREF{sequential} ( \VAR{X}, \NAMEREF{while-true} ( \VAR{B}, \VAR{X} ) ), \NAMEHYPER{../../../Values/Primitive}{Null}{null-value} ) \\ \KEY{Alias} \quad & \NAMEDECL{while} = \NAMEREF{while-true} \end{align*}\]

\(\SHADE{\NAMEREF{while-true} ( \VAR{B}, \VAR{X} )}\) evaluates \(\SHADE{\VAR{B}}\) to a Boolean value. Depending on the value of \(\SHADE{\VAR{B}}\), it either executes \(\SHADE{\VAR{X}}\) and iterates, or terminates normally.

The effect of abruptly breaking the iteration is obtained by the combination \(\SHADE{\NAMEHYPER{../../Abnormal}{Breaking}{handle-break} ( \NAMEREF{while-true} ( \VAR{B}, \VAR{X} ) )}\), and that of abruptly continuing the iteration by \(\SHADE{\NAMEREF{while-true} ( \VAR{B}, \NAMEHYPER{../../Abnormal}{Continuing}{handle-continue} ( \VAR{X} ) )}\).

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{do-while-true}( \VAR{X} : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type}, \VAR{B} : \TO \NAMEHYPER{../../../Values/Primitive}{Booleans}{booleans}) : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type} \\&\quad \leadsto \NAMEREF{sequential} ( \VAR{X}, \NAMEREF{if-true-else} ( \VAR{B}, \NAMEREF{do-while-true} ( \VAR{X}, \VAR{B} ), \NAMEHYPER{../../../Values/Primitive}{Null}{null-value} ) ) \\ \KEY{Alias} \quad & \NAMEDECL{do-while} = \NAMEREF{do-while-true} \end{align*}\]

\(\SHADE{\NAMEREF{do-while-true} ( \VAR{X}, \VAR{B} )}\) is equivalent to \(\SHADE{\NAMEREF{sequential} ( \VAR{X}, \NAMEREF{while-true} ( \VAR{B}, \VAR{X} ) )}\).

Interleaving

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{interleave}( \_ : \VAR{T}\STAR) : \TO \VAR{T}\STAR \end{align*}\]

\(\SHADE{\NAMEREF{interleave} ( \cdots )}\) computes its arguments in any order, possibly interleaved, and returns the resulting sequence of values, provided all terminate normally. Fairness of interleaving is not required, so pure left-to-right computation is allowed.

\(\SHADE{\NAMEREF{atomic} ( \VAR{X} )}\) prevents interleaving in \(\SHADE{\VAR{X}}\), except after transitions that emit a \(\SHADE{\NAMEREF{yielded} ( \NAMEREF{signal} )}\).

\[\begin{align*} \KEY{Rule} \quad & \NAMEREF{interleave} ( \VAR{V}\STAR : \VAR{T}\STAR ) \leadsto \VAR{V}\STAR \end{align*}\] \[\begin{align*} \KEY{Datatype} \quad \NAMEDECL{yielding} \ ::= \ & \NAMEDECL{signal} \end{align*}\] \[\begin{align*} \KEY{Entity} \quad & \_ \xrightarrow{\NAMEDECL{yielded}(\_ : \NAMEREF{yielding}\QUERY)} \_ \end{align*}\]

\(\SHADE{\NAMEREF{yielded} ( \NAMEREF{signal} )}\) in a label on a transition allows interleaving at that point in the enclosing atomic computation. \(\SHADE{\NAMEREF{yielded} ( \ )}\) indicates interleaving at that point in an atomic computation is not allowed.

\[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{yield} : \TO \NAMEHYPER{../../../Values/Primitive}{Null}{null-type} \\&\quad \leadsto \NAMEREF{yield-on-value} ( \NAMEHYPER{../../../Values/Primitive}{Null}{null-value} ) \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{yield-on-value}( \_ : \VAR{T}) : \TO \VAR{T} \end{align*}\]

\(\SHADE{\NAMEREF{yield-on-value} ( \VAR{X} )}\) allows interleaving in an enclosing atomic computation on normal termination of \(\SHADE{\VAR{X}}\).

\[\begin{align*} \KEY{Rule} \quad & \NAMEREF{yield-on-value} ( \VAR{V} : \VAR{T} ) \xrightarrow{\NAMEREF{yielded}( \NAMEREF{signal} )}_{} \VAR{V} \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{yield-on-abrupt}( \_ : \TO \VAR{T}) : \TO \VAR{T} \end{align*}\]

\(\SHADE{\NAMEREF{yield-on-abrupt} ( \VAR{X} )}\) ensures that abrupt termination of \(\SHADE{\VAR{X}}\) is propagated through an enclosing atomic computation.

\[\begin{align*} \KEY{Rule} \quad & \RULE{ & \VAR{X} \xrightarrow{\NAMEHYPER{../../Abnormal}{Abrupting}{abrupt}( \VAR{V} : \VAR{T} ), \NAMEREF{yielded}( \_\QUERY )}_{} \VAR{X}' }{ & \NAMEREF{yield-on-abrupt} ( \VAR{X} ) \xrightarrow{\NAMEHYPER{../../Abnormal}{Abrupting}{abrupt}( \VAR{V} ), \NAMEREF{yielded}( \NAMEREF{signal} )}_{} \NAMEREF{yield-on-abrupt} ( \VAR{X}' ) } \\ \KEY{Rule} \quad & \RULE{ & \VAR{X} \xrightarrow{\NAMEHYPER{../../Abnormal}{Abrupting}{abrupt}( \ )}_{} \VAR{X}' }{ & \NAMEREF{yield-on-abrupt} ( \VAR{X} ) \xrightarrow{\NAMEHYPER{../../Abnormal}{Abrupting}{abrupt}( \ )}_{} \NAMEREF{yield-on-abrupt} ( \VAR{X}' ) } \\ \KEY{Rule} \quad & \NAMEREF{yield-on-abrupt} ( \VAR{V} : \VAR{T} ) \leadsto \VAR{V} \end{align*}\] \[\begin{align*} \KEY{Funcon} \quad & \NAMEDECL{atomic}( \_ : \TO \VAR{T}) : \TO \VAR{T} \end{align*}\]

\(\SHADE{\NAMEREF{atomic} ( \VAR{X} )}\) computes \(\SHADE{\VAR{X}}\), but controls its potential interleaving with other computations: interleaving is only allowed following a transition of \(\SHADE{\VAR{X}}\) that emits \(\SHADE{\NAMEREF{yielded} ( \NAMEREF{signal} )}\).

\[\begin{align*} \KEY{Rule} \quad & \RULE{ & \VAR{X} \xrightarrow{\NAMEREF{yielded}( \ )}_{1} \VAR{X}'\\& \NAMEREF{atomic} ( \VAR{X}' ) \xrightarrow{\NAMEREF{yielded}( \ )}_{2} \VAR{X}'' }{ & \NAMEREF{atomic} ( \VAR{X} ) \xrightarrow{\NAMEREF{yielded}( \ )}_{1} ; \xrightarrow{\NAMEREF{yielded}( \ )}_{2} \VAR{X}'' } \\ \KEY{Rule} \quad & \RULE{ & \VAR{X} \xrightarrow{\NAMEREF{yielded}( \ )}_{} \VAR{V}\\& \VAR{V} : \VAR{T} }{ & \NAMEREF{atomic} ( \VAR{X} ) \xrightarrow{\NAMEREF{yielded}( \ )}_{} \VAR{V} } \\ \KEY{Rule} \quad & \NAMEREF{atomic} ( \VAR{V} : \VAR{T} ) \leadsto \VAR{V} \\ \KEY{Rule} \quad & \RULE{ & \VAR{X} \xrightarrow{\NAMEREF{yielded}( \NAMEREF{signal} )}_{} \VAR{X}' }{ & \NAMEREF{atomic} ( \VAR{X} ) \xrightarrow{\NAMEREF{yielded}( \ )}_{} \NAMEREF{atomic} ( \VAR{X}' ) } \end{align*}\]