From aeec785e1d00c613973b4912d4b0f510954491ec Mon Sep 17 00:00:00 2001
From: Chris Barker <barker@omega.(none)>
Date: Fri, 26 Nov 2010 23:46:48 -0500
Subject: [PATCH] edits

---
 zipper-lists-continuations.mdwn | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/zipper-lists-continuations.mdwn b/zipper-lists-continuations.mdwn
index fef92b73..bfd144c1 100644
--- a/zipper-lists-continuations.mdwn
+++ b/zipper-lists-continuations.mdwn
@@ -228,10 +228,12 @@ Sigh.  Ocaml won't show us our own list.  So we have to choose an `f`
 and a `z` that will turn our hand-crafted lists into standard Ocaml
 lists, so that they will print out.
 
+<pre>
 # let cons h t = h :: t;;  (* Ocaml is stupid about :: *)
 # l'_bind (fun f z -> f 1 (f 2 z)) 
           (fun i -> fun f z -> f i (f (i+1) z)) cons [];;
 - : int list = [1; 2; 2; 3]
+</pre>
 
 Ta da!
 
@@ -302,3 +304,6 @@ versa.  The connections will be expecially relevant when we consider
 indefinites and Hamblin semantics on the linguistic side, and
 non-determinism on the list monad side.
 
+Refunctionalizing zippers
+-------------------------
+
-- 
2.11.0