X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment9.mdwn;h=13cf8fd4a89c9165cc201589cfa402312d7f71d7;hp=145904ae33208b543baa338a2d97a410453d29a7;hb=c622f91ab9df73744ac421726b9feed993d054c0;hpb=e1e73571e65c3c8c138f375a7893a1bd76fa2f4d

diff --git a/assignment9.mdwn b/assignment9.mdwn
index 145904ae..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
@@ -118,14 +118,14 @@ val make_int_stream : int -> int stream = [fun]
 val int_stream : int stream = Next (1, [fun])         (* First element: 1 *)
 
 # let tail = match int_stream with Next (i, rest) -> rest;;      
-val tail : unit -> int stream = <fun>                      (* Tail: a thunk *)
+val tail : unit -> int stream = [fun]                 (* Tail: a thunk *)
 
 (* Force the thunk to compute the second element *)
 # tail ();;
 - : int stream = Next (2, [fun])                      (* Second element: 2 *)
 
 # match tail () with Next (_, rest) -> rest ();;
-- : int stream = Next (3, <fun>)                           (* Third element: 3 *)
+- : int stream = Next (3, [fun])                      (* Third element: 3 *)
 </pre>
 
 You can think of `int_stream` as a functional object that provides