edits

[lambda.git] / exercises / assignment3.mdwn

diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index 5bee7a4..7121fae 100644 (file)
--- a/exercises/assignment3.mdwn
+++ b/exercises/assignment3.mdwn
@@ -77,6 +77,11 @@ Using the mapping specified in this week's notes, translate the following lambda
 
 25. For each of the above translations, how many `I`s are there? Give a rule for describing what each `I` corresponds to in the original lambda term.
 
+    This generalization depends on you omitting the translation rule:
+
+        6. @a(Xa)       =   X            if a is not in X
+
+
 Evaluation strategies in Combinatory Logic
 ------------------------------------------