X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=exercises%2Fassignment7.mdwn;h=f26f5d834912a1d846855645033f2514a82f3538;hb=29fb3ed9c63e37aeaeef765c1c11986bd1f84f41;hp=e9cf82371162e91fb718094a669a096e5809a337;hpb=9d1d3d7d480c1c808a7a9fddf39f95037196d506;p=lambda.git
diff --git a/exercises/assignment7.mdwn b/exercises/assignment7.mdwn
index e9cf8237..f26f5d83 100644
--- a/exercises/assignment7.mdwn
+++ b/exercises/assignment7.mdwn
@@ -78,7 +78,7 @@ boxed types. Here, a "boxed type" is a type function with one unsaturated
hole (which may have several occurrences, as in `(α,α) tree`). We can think of the box type
as a function from a type to a type.
-Recall that a monad requires a singleton function mid : P-> P
, and a
+Recall that a monad requires a singleton function ⧠(* mid *) : P-> P
, and a
composition operator like >=> : (P->Q) -> (Q->R) -> (P->R)
.
As we said in the notes, we'll move freely back and forth between using `>=>` and using `<=<` (aka `mcomp`), which
@@ -86,19 +86,19 @@ is just `>=>` with its arguments flipped. `<=<` has the virtue that it correspon
closely to the ordinary mathematical symbol `â`. But `>=>` has the virtue
that its types flow more naturally from left to right.
-Anyway, `mid` and (let's say) `<=<` have to obey the Monad Laws:
+Anyway, `mid`/`â§` and (let's say) `<=<` have to obey the Monad Laws:
- mid <=< k = k
- k <=< mid = k
- j <=< (k <=< l) = (j <=< k) <=< l
+ ⧠<=< k == k
+ k <=< ⧠== k
+ j <=< (k <=< l) == (j <=< k) <=< l
-For example, the Identity monad has the identity function `I` for `mid`
+For example, the Identity monad has the identity function `I` for `â§`
and ordinary function composition `â` for `<=<`. It is easy to prove
that the laws hold for any terms `j`, `k`, and `l` whose types are
-suitable for `mid` and `<=<`:
+suitable for `â§` and `<=<`:
- mid <=< k == I â k == \p. I (k p) ~~> \p. k p ~~> k
- k <=< mid == k â I == \p. k (I p) ~~> \p. k p ~~> k
+ ⧠<=< k == I â k == \p. I (k p) ~~> \p. k p ~~> k
+ k <=< ⧠== k â I == \p. k (I p) ~~> \p. k p ~~> k
(j <=< k) <=< l == (\p. j (k p)) â l == \q. (\p. j (k p)) (l q) ~~> \q. j (k (l q))
j <=< (k <=< l) == j â (k â l) == j â (\p. k (l p)) == \q. j ((\p. k (l p)) q) ~~> \q. j (k (l q))
@@ -119,7 +119,7 @@ More specifically,
Show that your composition operator obeys the Monad Laws.
2. Do the same with lists. That is, given an arbitrary type
-`'a`, let the boxed type be `['a]` or `'a list`, that is, lists of values of type `'a`. The `mid`
+`'a`, let the boxed type be `['a]` or `'a list`, that is, lists of values of type `'a`. The `â§`
is the singleton function `\p. [p]`, and the composition operator is:
let (>=>) (j : 'a -> 'b list) (k : 'b -> 'c list) : 'a -> 'c list =
@@ -129,4 +129,9 @@ is the singleton function `\p. [p]`, and the composition operator is:
let j a = [a; a+1];;
let k b = [b*b; b+b];;
- (j >=> k) 7 (* ==> [49; 14; 64; 16] *)
+ (j >=> k) 7
+ (* which OCaml evaluates to:
+ - : int list = [49; 14; 64; 16]
+ *)
+
+ Show that these obey the Monad Laws.