X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2Fassignment3.mdwn;h=21997eeb707d2304bc8f08c3545ee8b848a992a2;hp=e2fd9627aca07dc9ef54816d36d3382af0e17834;hb=14afd28fe72ee04e9accb957cd42686479dc38bb;hpb=b2419a4f0b2553436526080563affc9877b278f1
diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index e2fd9627..21997eeb 100644
--- a/exercises/assignment3.mdwn
+++ b/exercises/assignment3.mdwn
@@ -68,6 +68,25 @@ Using the mapping specified in this week's notes, translate the following lambda
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
--------------------