X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment7.mdwn;h=d6cb6813125279b02da88d34757d4d75b92415e6;hp=332b1187b0cdcca329df27d8c28a7eb6b8af431d;hb=HEAD;hpb=e44177b8c022471ebfeb1d8dc4a93cde1e840cb7

diff --git a/assignment7.mdwn b/assignment7.mdwn
deleted file mode 100644
index 332b1187..00000000
--- a/assignment7.mdwn
+++ /dev/null
@@ -1,19 +0,0 @@
-**The hints for problem 2 were being actively developed until Saturday morning. They're 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:
-
-		let div x y = x / y;;
-		let remainder x y = x mod y;;
-
-	Write a monadic operation that enables you to retrieve the last-saved remainder, at any arbitrary later point in the computation.
-
-2. For the next assignment, read the paper [Coreference and Modality](/coreference-and-modality.pdf). Your task will be to re-express the semantics they offer up to the middle of p. 16, in the terms we're now working with. You'll probably want to review [the lecture notes from this week's meeting](/week9).
-
-	Some advice:
-
-	*	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.
-
-	*	Here are some [hints](/hints/assignment_7_hint_1).
-