From 09ec7867983b953fd10c12de1d67bc350bb6c871 Mon Sep 17 00:00:00 2001
From: chris
Date: Sun, 8 Mar 2015 17:30:51 -0400
Subject: [PATCH]
---
topics/_week7_eval_cl.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/topics/_week7_eval_cl.mdwn b/topics/_week7_eval_cl.mdwn
index ef5a2094..102848d2 100644
--- a/topics/_week7_eval_cl.mdwn
+++ b/topics/_week7_eval_cl.mdwn
@@ -7,7 +7,7 @@
We've discussed evaluation order before, primarily in connection with
the untyped lambda calculus. Whenever a term contains more than one
redex, we have to choose which one to reduce, and this choice can make
-a difference. For instance, in the term `((\x.I)(ÏÏ)`, if we reduce
+a difference. For instance, in the term `((\x.I)(ÏÏ))`, if we reduce
the leftmost redex first, the term reduces to the normal form `I` in
one step. But if we reduce the left most redex instead (namely,
`(ÏÏ)`), we do not arrive at a normal form, and are in danger of
--
2.11.0