From 4d77188b080ae01ca1a58559481c5a2cfff7cbe2 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 1 Dec 2010 00:24:43 -0500 Subject: [PATCH] lists-to-contin tweaks Signed-off-by: Jim Pryor --- from_lists_to_continuations.mdwn | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/from_lists_to_continuations.mdwn b/from_lists_to_continuations.mdwn index a3ed6bfc..c67d5e86 100644 --- a/from_lists_to_continuations.mdwn +++ b/from_lists_to_continuations.mdwn @@ -131,8 +131,8 @@ to get there, we'll first do the exact same thing we just did with concrete zipper using procedures. Think of a list as a procedural recipe: `['a'; 'b'; 'S'; 'd']` -is the result of the computation `a::(b::(S::(d::[])))` (or, in our old -style, `makelist a (makelist b (makelist S (makelist c empty)))`). +is the result of the computation `'a'::('b'::('S'::('d'::[])))` (or, in our old +style, `make_list 'a' (make_list 'b' (make_list 'S' (make_list 'd' empty)))`). The recipe for constructing the list goes like this:
```@@ -151,10 +151,10 @@ be a function of type `char list -> char list`.  We'll call each step
context, a continuation is a function of type `char list -> char
list`.  For instance, the continuation corresponding to the portion of
the recipe below the horizontal line is the function `fun (tail:char
-list) -> a::(b::tail)`.
+list) -> 'a'::('b'::tail)`.

This means that we can now represent the unzipped part of our
-zipper--the part we've already unzipped--as a continuation: a function
+zipper---the part we've already unzipped---as a continuation: a function
describing how to finish building the list.  We'll write a new
function, `tc` (for task with continuations), that will take an input
list (not a zipper!) and a continuation and return a processed list.
--
2.11.0

```