From e04dfd398545d8708aa399624dc80bd5a9e3f596 Mon Sep 17 00:00:00 2001
From: jim <jim@web>
Date: Mon, 23 Feb 2015 14:22:49 -0500
Subject: [PATCH] add note about generalization

---
 exercises/assignment3.mdwn | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index 5bee7a43..7121faee 100644
--- 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
 ------------------------------------------
 
-- 
2.11.0