+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
+------------------------------------------
+
+26. Find a term in CL that behaves like Omega does in the Lambda
+Calculus. Call it `Skomega`.
+
+27. Are there evaluation strategies in CL corresponding to leftmost
+reduction and rightmost reduction in the Lambda Calculus?
+What counts as a redex in CL?
+
+28. Consider the CL term `K I Skomega`. Does leftmost (alternatively,
+rightmost) evaluation give results similar to the behavior of `K I
+Omega` in the Lambda Calculus, or different? What features of the
+Lambda Calculus and CL determine this answer?
+
+29. What should count as a thunk in CL? What is the equivalent
+constraint in CL to forbidding evaluation inside of a lambda abstract?
+
+
+More Lambda Practice
+--------------------
+
+Reduce to beta-normal forms:
+
+<OL start=30>
+<LI><code>(\x. x (\y. y x)) (v w)</code>
+<LI><code>(\x. x (\x. y x)) (v w)</code>
+<LI><code>(\x. x (\y. y x)) (v x)</code>
+<LI><code>(\x. x (\y. y x)) (v y)</code>
+
+<LI><code>(\x y. x y y) u v</code>
+<LI><code>(\x y. y x) (u v) z w</code>
+<LI><code>(\x y. x) (\u u)</code>
+<LI><code>(\x y z. x z (y z)) (\u v. u)</code>
+</OL>
+