From: Chris Barker <barker@kappa.linguistics.fas.nyu.edu>
Date: Tue, 7 Dec 2010 18:28:07 +0000 (-0500)
Subject: edit
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=eae3c74f423d855b5f3a282af2c68d2bf222172f

edit
---

diff --git a/assignment9.mdwn b/assignment9.mdwn
index c8d2889f..13cf8fd4 100644
--- a/assignment9.mdwn
+++ b/assignment9.mdwn
@@ -62,7 +62,7 @@ Two strategies for solving the problem
     does: compute the tree-to-list transformation for a tree with two
     leaves, performing all beta reduction by hand using the
     definitions for bind\_continuation, unit\_continuation and so on.
-    If you take this route, study the description of streams (a
+    If you take this route, study the description of **streams** (a
     particular kind of data structure) below.  The goal will be to
     arrange for the continuation-flavored tree_monadizer to transform
     a tree into a stream instead of into a list.  Once you've done