projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
ef15f2c
)
edits
author
Chris Barker
<barker@omega.(none)>
Sat, 27 Nov 2010 04:46:48 +0000
(23:46 -0500)
committer
Chris Barker
<barker@omega.(none)>
Sat, 27 Nov 2010 04:46:48 +0000
(23:46 -0500)
zipper-lists-continuations.mdwn
patch
|
blob
|
history
diff --git
a/zipper-lists-continuations.mdwn
b/zipper-lists-continuations.mdwn
index
fef92b7
..
bfd144c
100644
(file)
--- 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
+-------------------------
+