X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=exercises%2F_assignment7.mdwn;h=587a1e0fb877326f01605281abaa4363ed029de6;hb=18b3eb5a07c8ad23c8d17c8e0d859c9d9516eab3;hp=cd798ab078ad9b86f986a8f40d396a487b579c3b;hpb=ef351afc1578508e294f73be1c2f2445463d6383;p=lambda.git

diff --git a/exercises/_assignment7.mdwn b/exercises/_assignment7.mdwn
index cd798ab0..587a1e0f 100644
--- a/exercises/_assignment7.mdwn
+++ b/exercises/_assignment7.mdwn
@@ -23,3 +23,10 @@ notes, prove that the evaluator does reduce expressions inside of
 does not perform reductions in those positions.
 
 <!-- just add early no-op cases for Ka and Sab -->
+
+3. Converting to lambdas.  Using the type definitions you developed in
+homework 5, rebuild the evaluator in OCaml to handle the untyped
+lambda calculus.  Making use of the occurs_free function you built,
+we'll provide a function that performs safe substitution.
+
+