(no commit message)

[lambda.git] / exercises / _assignment6.mdwn

diff --git a/exercises/_assignment6.mdwn b/exercises/_assignment6.mdwn
index 50e89ac..91566c9 100644 (file)
--- a/exercises/_assignment6.mdwn
+++ b/exercises/_assignment6.mdwn
@@ -134,8 +134,8 @@ piece, which we can think of as a function from a type to a type.
 Call this type function M, and let P, Q, R, and S be variables over types.
 
 Recall that a monad requires a singleton function 1:P-> MP, and a
-composition operator >=>: (P->MQ) -> (Q->MR) -> (P->MR) [type type for
-the composition operator corrects a "type"-o from the class handout]
+composition operator >=>: (P->MQ) -> (Q->MR) -> (P->MR) [the type for
+the composition operator given here corrects a "type"-o from the class handout]
 that obey the following laws:
 
     1 >=> k = k
@@ -170,19 +170,19 @@ Show your composition operator obeys the monad laws.
 'a, let the boxed type be a list of objects of type 'a.  The singleton
 is `\p.[p]`, and the composition operator is 
 
-     >=> (first:P->[Q]) (second:Q->[R]) :(P->[R]) = fun p -> [r | q <- first p, r <- second q]
+       >=> (first:P->[Q]) (second:Q->[R]) :(P->[R]) = fun p -> [r | q <- first p, r <- second q]
 
 Sanity check: 
 
-    f p = [x, x+1]
-    s q = [x*x, x+x]
-    >=> f s 7 = [49, 14, 64, 16]
+     f p = [x, x+1]
+     s q = [x*x, x+x]
+     >=> f s 7 = [49, 14, 64, 16]
 
 3. Do the same for zippy lists.  That is, you need to find a
 composition operator such that
 
-    f p = [x, x+1]
-    s q = [x*x, x+x]
-    >=> f s 7 = [49, 64]
+     f p = [x, x+1]
+     s q = [x*x, x+x]
+     >=> f s 7 = [49, 64]
 
 and then prove it obeys the monad laws.