From: Jim Pryor <profjim@jimpryor.net>
Date: Mon, 1 Nov 2010 00:35:06 +0000 (-0400)
Subject: expand name 'towards monads'
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=a514805caa6f1ca2ac4bad1674fbc74622e71968;ds=sidebyside

expand name 'towards monads'

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

diff --git a/index.mdwn b/index.mdwn
index f2bb56ae..e336e553 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -47,7 +47,7 @@ preloaded is available at [[assignment 3 evaluator]].
 
 (18 Oct, 25 Oct) Lecture notes for [[Week5]] and [[Week6]]; [[Assignment5]].
 
->	Topics: Types, Polymorphism
+>	Topics: Types, Polymorphism, Dividing by Zero
 
 (1 Nov) Lecture notes for Week7; Assignment6.
 
diff --git a/week6.mdwn b/week6.mdwn
index 7a5ae2c2..81e7a83e 100644
--- a/week6.mdwn
+++ b/week6.mdwn
@@ -171,8 +171,8 @@ We can use functions that take arguments of type unit to control
 execution.  In Scheme parlance, functions on the unit type are called
 *thunks* (which I've always assumed was a blend of "think" and "chunk").
 
-Towards Monads
---------------
+Dividing by zero: Towards Monads
+--------------------------------
 
 So the integer division operation presupposes that its second argument
 (the divisor) is not zero, upon pain of presupposition failure.