From 8dc497d55a7d1931fc916246506eac923e7a7188 Mon Sep 17 00:00:00 2001 From: chris Date: Sat, 14 Mar 2015 13:26:42 -0400 Subject: [PATCH 1/1] --- topics/_week7_eval_cl.mdwn | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) 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 -- 2.11.0