X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_week7_eval_cl.mdwn;h=4d1b3e761f43ef083dd06b6ff00dbd4a0829e5c4;hp=793e10ecf142589d0e8ac5a49cfbdba9cd6da4b1;hb=8dc497d55a7d1931fc916246506eac923e7a7188;hpb=9789c1adea9056a288c32272203892aae139dd2e

diff --git a/topics/_week7_eval_cl.mdwn b/topics/_week7_eval_cl.mdwn
index 793e10ec..4d1b3e76 100644
--- a/topics/_week7_eval_cl.mdwn
+++ b/topics/_week7_eval_cl.mdwn
@@ -23,8 +23,7 @@ danger of entering an infinite loop.
 
 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.
+order by writing a program that allows us to reasoning explicitly about evaluation.
 
 One thing we'll see is that it is all too easy for the evaluation
 order properties of an evaluator to depend on the evaluation order