edits

[lambda.git] / exercises / _assignment7.mdwn

diff --git a/exercises/_assignment7.mdwn b/exercises/_assignment7.mdwn
index cd798ab..8cf57f2 100644 (file)
--- a/exercises/_assignment7.mdwn
+++ b/exercises/_assignment7.mdwn
@@ -23,3 +23,9 @@ 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.
+