X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=from_list_zippers_to_continuations.mdwn;h=3890f909d801bc2eacf88d23202938cbc716b29f;hp=b4dd946e9d2624a3924db8930a69332073a897ec;hb=787a842deca12cc0a1d2bc14006f000a5eb4c07d;hpb=154478373709119419173d26bdf43e36940a54f2

diff --git a/from_list_zippers_to_continuations.mdwn b/from_list_zippers_to_continuations.mdwn
index b4dd946e..3890f909 100644
--- a/from_list_zippers_to_continuations.mdwn
+++ b/from_list_zippers_to_continuations.mdwn
@@ -173,7 +173,7 @@ take on the same values in the same series of steps as they did during
 the execution of `tz` above.  There will once again be one initial and
 four recursive calls to `tc`, and `zipped` will take on the values
 `"bSd"`, `"Sd"`, `"d"`, and `""` (and, once again, on the final call,
-the first `match` clause will fire, so the the variable `zipper` will
+the first `match` clause will fire, so the the variable `zipped` will
 not be instantiated).
 
 I have not called the functional argument `unzipped`, although that is
@@ -214,7 +214,6 @@ continuations with embedded `prompt`s (also called `reset`s).
 
 The reason the task is well-suited to the list zipper is in part
 because the list monad has an intimate connection with continuations.
-The following section explores this connection.  We'll return to the
-list task after talking about generalized quantifiers below.
+We'll explore this next.