X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment7.mdwn;h=9f83b00924dca4212d23174d2116dae4f3c1d102;hp=dd325bb2563796fda0212f858f276f49734f3508;hb=60fde0202775a36c5b20c370374649d2a90c6af8;hpb=48c6e643b5deb62c34c84e0190466be34c00283b

diff --git a/assignment7.mdwn b/assignment7.mdwn
index dd325bb2..9f83b009 100644
--- a/assignment7.mdwn
+++ b/assignment7.mdwn
@@ -1,3 +1,4 @@
+**The hints for problem 2 were being actively developed until early Saturday morning. They're pretty stable now. Remember you have a grace period until Sunday Nov. 28 to complete this homework.**
 
 1. Make sure that your operation-counting monad from [[assignment6]] is working. Modify it so that instead of counting operations, it keeps track of the last remainder of any integer division. You can help yourself to the functions:
 
@@ -10,7 +11,7 @@
 
 	Some advice:
 
-	*	You don't need to re-express the epistemic modality part of their semantics, just the treatment of indefinites. Though extra credit if you do the whole thing.
+	*	You don't need to re-express the epistemic modality part of their semantics, just their treatment of extensional predicate logic. Though extra credit if you want to do the whole thing.
 
 	*	You'll want to use the implementation of "implicitly represented" mutable variables that we discussed at the end of this week's meeting, or the "state monad" Chris presented, which is a simple version of the former.