From 26c272f53f47a1215a48e3092b132a157c60ccfa Mon Sep 17 00:00:00 2001
From: Adam Chlipala <adam@chlipala.net>
Date: Sat, 27 Mar 2021 16:17:19 -0400
Subject: [PATCH] Typographical fix

---
 frap_book.tex | 1 -
 1 file changed, 1 deletion(-)

diff --git a/frap_book.tex b/frap_book.tex
index 34ad08b..3efa674 100644
--- a/frap_book.tex
+++ b/frap_book.tex
@@ -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}$$