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

diff --git a/zipper-lists-continuations.mdwn b/zipper-lists-continuations.mdwn
index 0eb3128f..ed822f88 100644
--- a/zipper-lists-continuations.mdwn
+++ b/zipper-lists-continuations.mdwn
@@ -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