From 9789c1adea9056a288c32272203892aae139dd2e Mon Sep 17 00:00:00 2001 From: chris Date: Sat, 14 Mar 2015 13:25: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 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. -- 2.11.0