X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=week7.mdwn;h=ba845b2960f4a1540d3a7991c9d1b9f1e90711aa;hb=966f3179a2866846d6b0e347b32ebe56da8cdd5e;hp=a4538ee3e3e5572c504adf9495bc9e594224c8e7;hpb=63b3d068ec7da4f7ad620d2e8ff674495b642024;p=lambda.git 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 ). +laws (see , 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