From 1487bf1e23d780ed6abd773c7650115cce1f831a Mon Sep 17 00:00:00 2001
From: Chris Barker
Date: Mon, 1 Nov 2010 15:24:42 -0400
Subject: [PATCH] Added assignmemnt 6
---
assignment6.mdwn | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
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
--
2.11.0