Template Instantiator State Transition Rules¶
Evaluation is complete when a single NNum remains on the stack and the
dump is empty.
Dereference an indirection passed as an argument to a function.
![\transrule
{a : s & d & h
\begin{bmatrix}
a : \mathtt{NAp} \; a_1 \; a_2 \\
a_2 : \mathtt{NInd} \; a_3
\end{bmatrix} & g}
{a : s & d & h[a : \mathtt{NAp} \; a_1 \; a_3] & g}](../_images/math/ecdbb83ab452d27fcd79c1567929508177d87f1f.svg)
Dereference an indirection on top of the stack.
Perform a unary operation 
with internal Prim constructor
O on an argument in normal form.
Evaluate the argument of a unary operation with internal Prim
constructor O.
Restore the stack when a sub-computation has completed.
Reduce a supercombinator and update the root with the 
-reduced form
![\transrule
{ a_0 : a_1 : \ldots : a_n : s
& d
& h
\begin{bmatrix}
a_0 : \mathtt{NSupercomb} \; [x_1,\ldots,x_n] \; e
\end{bmatrix}
& g
}
{ a_n : s
& d
& h'
& g
\\
& \SetCell[c=3]{c}
\text{where } h' = \mathtt{instantiateU} \; e \; a_n \; h \; g
}](../_images/math/80185f417c32abbbd850f4429d27d4111dd55ce6.svg)
Perform a binary operation 
associated with internal Prim
constructor O on two NNum s both in normal form.
In a conditional primitive, perform the reduction if the condition has been
evaluated as True (NData 1 []).
In a conditional primitive, perform the reduction if the condition has been
evaluated as False (NData 0 []).
In a conditional primitive, evaluate the condition.
Construct NData out of a constructor and its arguments
![\transrule
{ c : a_1 : \ldots : a_n : \nillist
& d
& h
\begin{bmatrix}
c : \mathtt{NPrim} \; (\mathtt{ConP} \; t \; n) \\
a_1 : \mathtt{NAp} \; c \; x_1 \\
\vdots \\
a_n : \mathtt{NAp} \; a_{n-1} \; x_n
\end{bmatrix}
& g
}
{ a_n : \nillist
& d
& h
\begin{bmatrix}
a_n : \mathtt{NData} \; t \; [x_1, \ldots, x_n]
\end{bmatrix}
& g
}](../_images/math/8d27e16980b44cbe4694fb91353c71239780608d.svg)
Pairs¶
Evaluate the first argument if necessary
Perform the reduction if the first argument is in normal form
![\transrule
{ c : a_1 : a_2 : s
& d
& h
\begin{bmatrix}
c : \mathtt{NPrim} \; \mathtt{CasePairP} \\
p : \mathtt{NData} \; 0 \; [x,y] \\
a_1 : \mathtt{NAp} \; c \; p \\
a_2 : \mathtt{NAp} \; a_1 \; f
\end{bmatrix}
& g
}
{ a_1 : a_2 : s
& d
& h
\begin{bmatrix}
a_1 : \mathtt{NAp} \; f \; x \\
a_2 : \mathtt{NAp} \; a_1 \; y
\end{bmatrix}
& g
}](../_images/math/34c5ba211557474d30a91f5ea6cf5692b3b88610.svg)
Lists¶
Evaluate the scrutinee
If the scrutinee is Nil, perform the appropriate reduction.
