From: chris <chris@web>
Date: Sat, 14 Mar 2015 17:25:51 +0000 (-0400)
Subject: (no commit message)
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=9789c1adea9056a288c32272203892aae139dd2e

---

diff --git a/topics/_week7_eval_cl.mdwn b/topics/_week7_eval_cl.mdwn
index 933943a1..793e10ec 100644
--- a/topics/_week7_eval_cl.mdwn
+++ b/topics/_week7_eval_cl.mdwn
@@ -21,7 +21,7 @@ to the normal form `I` in one step.  But if we reduce the rightmost
 redex instead, the "reduced" form is `(\x.I)Ω` again, and we are in
 danger of entering an infinite loop.
 
-Thanks to the recent introduction of sum types (disjoint union), we
+Thanks to the introduction of sum types (disjoint union) in the last lecture, we
 are now in a position to gain a deeper understanding of evaluation
 order by reasoning explicitly about evaluation by writing a program
 that evaluates terms.