projects
/
lambda.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
tweak indexes
[lambda.git]
/
from_list_zippers_to_continuations.mdwn
diff --git
a/from_list_zippers_to_continuations.mdwn
b/from_list_zippers_to_continuations.mdwn
index
59185df
..
dcd11ce
100644
(file)
--- a/
from_list_zippers_to_continuations.mdwn
+++ b/
from_list_zippers_to_continuations.mdwn
@@
-6,9
+6,9
@@
to continuations is to re-functionalize a zipper. Then the
concreteness and understandability of the zipper provides a way of
understanding an equivalent treatment using continuations.
concreteness and understandability of the zipper provides a way of
understanding an equivalent treatment using continuations.
-Let's work with lists of `char`s for a change.
To maximize readability, we'll
-indulge in an abbreviatory convention that "abSd" abbreviates the
-
list
`['a'; 'b'; 'S'; 'd']`.
+Let's work with lists of `char`s for a change.
We'll sometimes write
+"abSd" as an abbreviation for
+`['a'; 'b'; 'S'; 'd']`.
We will set out to compute a deceptively simple-seeming **task: given a
string, replace each occurrence of 'S' in that string with a copy of
We will set out to compute a deceptively simple-seeming **task: given a
string, replace each occurrence of 'S' in that string with a copy of
@@
-216,7
+216,7
@@
the closest `'#'`. This would allow our task to simulate delimited
continuations with embedded `prompt`s (also called `reset`s).
The reason the task is well-suited to the list zipper is in part
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
l
ist monad has an intimate connection with continuations.
+because the
L
ist monad has an intimate connection with continuations.
We'll explore this next.
We'll explore this next.