From: Chris Barker <barker@omega.(none)>
Date: Sun, 31 Oct 2010 14:24:46 +0000 (-0400)
Subject: edits
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=966f3179a2866846d6b0e347b32ebe56da8cdd5e

edits
---

diff --git a/week7.mdwn b/week7.mdwn
index a4538ee3..ba845b29 100644
--- a/week7.mdwn
+++ b/week7.mdwn
@@ -164,7 +164,7 @@ arguments of a monoid operation) the two arguments of the bind are of
 different types.  But if we generalize bind so that both arguments are
 of type `'a -> M 'a`, then we get plain identity laws and
 associativity laws, and the monad laws are exactly like the monoid
-laws (see <http://www.haskell.org/haskellwiki/Monad_Laws>).
+laws (see <http://www.haskell.org/haskellwiki/Monad_Laws>, near the bottom).
 
 
 Monad outlook
@@ -191,8 +191,11 @@ intensionality](http://parles.upf.es/glif/pub/sub11/individual/bena_wint.pdf),
 though without explicitly using monads.
 
 All of the code in the discussion below can be found here: [[intensionality-monad.ml]].
-To run it, download the file, start Ocaml, and say `# #use
-"intensionality-monad.ml";;`. 
+To run it, download the file, start Ocaml, and say 
+
+    # #use "intensionality-monad.ml";;
+
+Note the extra `#` attached to the directive `use`.
 
 Here's the idea: since people can have different attitudes towards
 different propositions that happen to have the same truth value, we