23. 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.
+Evaluation strategies in Combinatory Logic
+------------------------------------------
+
+23. Find a term in CL that behaves like Omega does in the Lambda
+Calculus. Call it Skomega.
+
+24. Are there evaluation strategies in CL corresponding to leftmost
+reduction and rightmost reduction in the lambda calculus?
+What counts as a redex in CL?
+
+25. 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?
+
+26. 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
--------------------