Typographical fix

This commit is contained in:
Adam Chlipala 2021-03-27 16:17:19 -04:00
parent 25441b3991
commit 26c272f53f

View file

@ -3117,7 +3117,6 @@ A hallmark of a Turing-complete language is that it can host an interpreter for
$\lambda$-calculus is also straightforward to formalize with a small-step semantics\index{small-step operational semantics} and evaluation contexts\index{evaluation contexts}, following the method of Section \ref{eval_contexts}.
One might argue that the technique is even simpler for $\lambda$-calculus, since we must deal only with expressions, not also imperative variable valuations.
$$\begin{array}{rrcl}
\textrm{Evaluation contexts} & C &::=& \Box \mid C \; e \mid v \; C
\end{array}$$