X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=zipper-lists-continuations.mdwn;h=ed822f88dd77d469d0f648f0b9cd3d1f2709d0ae;hp=a2603dbad674c97dfae216d022e1cc0f58ce559f;hb=4b1834a17fc7a43ea9aa5166afcf5710b65f6856;hpb=89f14f08b65f2eb905065135670fbb1712cb9b16

diff --git a/zipper-lists-continuations.mdwn b/zipper-lists-continuations.mdwn
index a2603dba..ed822f88 100644
--- a/zipper-lists-continuations.mdwn
+++ b/zipper-lists-continuations.mdwn
@@ -275,7 +275,7 @@ similar to the List monad just given:
 type 'a continuation = ('a -> 'b) -> 'b
 c_unit (x:'a) = fun (p:'a -> 'b) -> p x
 c_bind (u:('a -> 'b) -> 'b) (f: 'a -> ('c -> 'd) -> 'd): ('c -> 'd) -> 'd =
-fun (k:'a -> 'b) -> u (fun (x:'a) -> f x k)
+  fun (k:'a -> 'b) -> u (fun (x:'a) -> f x k)
 </pre>
 
 How similar is it to the List monad?  Let's examine the type
@@ -294,8 +294,6 @@ parallel in a deep sense.  To emphasize the parallel, we can
 instantiate the type of the list' monad using the Ocaml list type:
 
     type 'a c_list = ('a -> 'a list) -> 'a list
-    let c_list_unit x = fun f -> f x;;
-    let c_list_bind u f = fun k -> u (fun x -> f x k);;
 
 Have we really discovered that lists are secretly continuations?
 Or have we merely found a way of simulating lists using list