X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment6.mdwn;h=62d1c5c54366c3e10b6163226b8a2686bfc485be;hp=b21050b4a166ce9dd9a5cf5281ae5b524af0e1f9;hb=1487bf1e23d780ed6abd773c7650115cce1f831a;hpb=1ad5ec14a5d9cde71122bb261e2e033deead6881
diff --git a/assignment6.mdwn b/assignment6.mdwn
index b21050b4..62d1c5c5 100644
--- a/assignment6.mdwn
+++ b/assignment6.mdwn
@@ -16,11 +16,11 @@ steps. By the way, that zero at the end provides the monadic object
with a starting point (0 relevant computations have occurred previous
to the current computation).
-Assume for the purposes of this excercise that no one ever tries to
+ Assume for the purposes of this excercise that no one ever tries to
divide by zero (so there should be no int option types anywhere in
your solution).
-You'll need to define a computation monad type, unit, bind, and lift.
+ You'll need to define a computation monad type, unit, bind, and lift.
We encourage you to consider this hint: [[Assignment 6 Hint 1]].
2. Prove that your monad satisfies the monad laws. First, give