+
+[[!toc]]
+
Today we're going to encounter continuations. We're going to come at
them from three different directions, and each time we're going to end
up at the same place: a particular monad, which we'll call the
continuation monad.
-The three approches are:
+Much of this discussion benefited from detailed comments and
+suggestions from Ken Shan.
-[[!toc]]
Rethinking the list monad
-------------------------
Since the type of an `'a reader` is `env -> 'a` (by definition),
the type of the `r_unit` function is `'a -> env -> 'a`, which is a
-specific case of the type of the *K* combinator. It makes sense
+specific case of the type of the *K* combinator. So it makes sense
that *K* is the unit for the reader monad.
Since the type of the `bind` operator is required to be
r_bind : ('a reader) -> ('a -> 'b reader) -> ('b reader)
-We can reason our way to the correct `bind` function as follows. We start by declaring the type:
+We can reason our way to the correct `bind` function as follows. We
+start by declaring the types determined by the definition of a bind operation:
- let r_bind (u : 'a reader) (f : 'a -> 'b reader) : ('b reader) =
+ let r_bind (u : 'a reader) (f : 'a -> 'b reader) : ('b reader) = ...
Now we have to open up the `u` box and get out the `'a` object in order to
feed it to `f`. Since `u` is a function from environments to
l_unit (a : 'a) = [a];;
l_bind u f = List.concat (List.map f u);;
-Recall that `List.map` take a function and a list and returns the
+Thinking through the list monad will take a little time, but doing so
+will provide a connection with continuations.
+
+Recall that `List.map` takes a function and a list and returns the
result to applying the function to the elements of the list:
List.map (fun i -> [i;i+1]) [1;2] ~~> [[1; 2]; [2; 3]]
l_bind [1;2] (fun i -> [i, i+1]) ~~> [1; 2; 2; 3]
-But where is the reasoning that led us to this unit and bind?
-And what is the type `['a]`? Magic.
-
-So let's indulge ourselves in a completely useless digression and see
-if we can gain some insight into the details of the List monad. Let's
-choose type constructor that we can peer into, using some of the
-technology we built up so laboriously during the first half of the
-course. We're going to use type 3 lists, partly because we know
-they'll give the result we want, but also because they're the coolest.
-These were the lists that made lists look like Church numerals with
-extra bits embdded in them:
+Now, why this unit, and why this bind? Well, ideally a unit should
+not throw away information, so we can rule out `fun x -> []` as an
+ideal unit. And units should not add more information than required,
+so there's no obvious reason to prefer `fun x -> [x,x]`. In other
+words, `fun x -> [x]` is a reasonable choice for a unit.
+
+As for bind, an `'a list` monadic object contains a lot of objects of
+type `'a`, and we want to make some use of each of them (rather than
+arbitrarily throwing some of them away). The only
+thing we know for sure we can do with an object of type `'a` is apply
+the function of type `'a -> 'a list` to them. Once we've done so, we
+have a collection of lists, one for each of the `'a`'s. One
+possibility is that we could gather them all up in a list, so that
+`bind' [1;2] (fun i -> [i;i]) ~~> [[1;1];[2;2]]`. But that restricts
+the object returned by the second argument of `bind` to always be of
+type `'b list list`. We can elimiate that restriction by flattening
+the list of lists into a single list: this is
+just List.concat applied to the output of List.map. So there is some logic to the
+choice of unit and bind for the list monad.
+
+Yet we can still desire to go deeper, and see if the appropriate bind
+behavior emerges from the types, as it did for the previously
+considered monads. But we can't do that if we leave the list type
+as a primitive Ocaml type. However, we know several ways of implementing
+lists using just functions. In what follows, we're going to use type
+3 lists (the right fold implementation), though it's important to
+wonder how things would change if we used some other strategy for
+implementating lists. These were the lists that made lists look like
+Church numerals with extra bits embdded in them:
empty list: fun f z -> z
list with one element: fun f z -> f 1 z
list with three elements: fun f z -> f 3 (f 2 (f 1 z))
and so on. To save time, we'll let the OCaml interpreter infer the
-principle types of these functions (rather than deducing what the
-types should be):
+principle types of these functions (rather than inferring what the
+types should be ourselves):
# fun f z -> z;;
- : 'a -> 'b -> 'b = <fun>
We can see what the consistent, general principle types are at the end, so we
can stop. These types should remind you of the simply-typed lambda calculus
-types for Church numerals (`(o -> o) -> o -> o`) with one extra bit thrown in
+types for Church numerals (`(o -> o) -> o -> o`) with one extra type
+thrown in, the type of the element a the head of the list
(in this case, an int).
So here's our type constructor for our hand-rolled lists:
(f : 'a -> ('c -> 'd -> 'd) -> 'd -> 'd)
: ('c -> 'd -> 'd) -> 'd -> 'd = ...
+Perhaps a bit intimiating.
But it's a rookie mistake to quail before complicated types. You should
be no more intimiated by complex types than by a linguistic tree with
deeply embedded branches: complex structure created by repeated
application of simple rules.
+[This would be a good time to try to build your own term for the types
+just given. Doing so (or attempting to do so) will make the next
+paragraph much easier to follow.]
+
As usual, we need to unpack the `u` box. Examine the type of `u`.
-This time, `u` will only deliver up its contents if we give `u` as an
-argument a function expecting an `'a` and a `'b`. `u` will fold that function over its type `'a` members, and that's how we'll get the `'a`s we need. Thus:
+This time, `u` will only deliver up its contents if we give `u` an
+argument that is a function expecting an `'a` and a `'b`. `u` will
+fold that function over its type `'a` members, and that's how we'll get the `'a`s we need. Thus:
... u (fun (a : 'a) (b : 'b) -> ... f a ... ) ...
Ta da!
-To bad this digression, though it ties together various
-elements of the course, has *no relevance whatsoever* to the topic of
-continuations...
Montague's PTQ treatment of DPs as generalized quantifiers
----------------------------------------------------------
gqize (a : e) = fun (p : e -> t) -> p a
-This function wraps up an individual in a fancy box. That is to say,
+This function is what Partee 1987 calls LIFT, and it would be
+reasonable to use it here, but we will avoid that name, given that we
+use that word to refer to other functions.
+
+This function wraps up an individual in a box. That is to say,
we are in the presence of a monad. The type constructor, the unit and
the bind follow naturally. We've done this enough times that we won't
belabor the construction of the bind function, the derivation is
-similar to the List monad just given:
+highly similar to the List monad just given:
type 'a continuation = ('a -> 'b) -> 'b
c_unit (a : 'a) = fun (p : 'a -> 'b) -> p a
c_bind (u : ('a -> 'b) -> 'b) (f : 'a -> ('c -> 'd) -> 'd) : ('c -> 'd) -> 'd =
fun (k : 'a -> 'b) -> u (fun (a : 'a) -> f a k)
-How similar is it to the List monad? Let's examine the type
-constructor and the terms from the list monad derived above:
+Note that `c_bind` is exactly the `gqize` function that Montague used
+to lift individuals into the continuation monad.
+
+That last bit in `c_bind` looks familiar---we just saw something like
+it in the List monad. How similar is it to the List monad? Let's
+examine the type constructor and the terms from the list monad derived
+above:
type ('a, 'b) list' = ('a -> 'b -> 'b) -> 'b -> 'b
l'_unit a = fun f -> f a
The unit and the bind for the Montague continuation monad and the
homemade List monad are the same terms! In other words, the behavior
of the List monad and the behavior of the continuations monad are
-parallel in a deep sense. To emphasize the parallel, we can
-instantiate the type of the list' monad using the OCaml list type:
-
- type 'a c_list = ('a -> 'a list) -> 'a list
+parallel in a deep sense.
Have we really discovered that lists are secretly continuations? Or
have we merely found a way of simulating lists using list
-continuations? Both perspectives are valid, and we can use our
-intuitions about the list monad to understand continuations, and vice
-versa (not to mention our intuitions about primitive recursion in
-Church numerals too). 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
--------------------------
+continuations? Well, strictly speaking, what we have done is shown
+that one particular implementation of lists---the right fold
+implementation---gives rise to a continuation monad fairly naturally,
+and that this monad can reproduce the behavior of the standard list
+monad. But what about other list implementations? Do they give rise
+to monads that can be understood in terms of continuations?
Manipulating trees with monads
------------------------------
type ('a -> 'b -> 'c) continuation = ('a -> 'b) -> 'c;;
-The tree monad
---------------
+The binary tree monad
+---------------------
Of course, by now you may have realized that we have discovered a new
-monad, the tree monad:
+monad, the binary tree monad:
<pre>
type 'a tree = Leaf of 'a | Node of ('a tree) * ('a tree);;
let tree_unit (x:'a) = Leaf x;;
let rec tree_bind (u:'a tree) (f:'a -> 'b tree):'b tree =
- match u with Leaf x -> f x | Node (l, r) -> Node ((tree_bind l f),
- (tree_bind r f));;
+ match u with Leaf x -> f x
+ | Node (l, r) -> Node ((tree_bind l f), (tree_bind r f));;
</pre>
For once, let's check the Monad laws. The left identity law is easy:
Left identity: bind (unit a) f = bind (Leaf a) f = fa
To check the other two laws, we need to make the following
-observation: it is easy to prove based on tree_bind by a simple
+observation: it is easy to prove based on `tree_bind` by a simple
induction on the structure of the first argument that the tree
resulting from `bind u f` is a tree with the same strucure as `u`,
except that each leaf `a` has been replaced with `fa`:
\tree (. (fa1) (. (. (. (fa2)(fa3)) (fa4)) (fa5)))
<pre>
- . .
- __|__ __|__
- | | | |
- a1 . fa1 .
- _|__ __|__
- | | | |
- . a5 . fa5
+ . .
+ __|__ __|__
+ | | | |
+ a1 . fa1 .
+ _|__ __|__
+ | | | |
+ . a5 . fa5
bind _|__ f = __|__
- | | | |
- . a4 . fa4
- __|__ __|___
- | | | |
- a2 a3 fa2 fa3
+ | | | |
+ . a4 . fa4
+ __|__ __|___
+ | | | |
+ a2 a3 fa2 fa3
</pre>
Given this equivalence, the right identity law
Associativity: bind (bind u f) g = bind u (\a. bind (fa) g)
we'll give an example that will show how an inductive proof would
-have to proceed. Let `f a = Node (Leaf a, Leaf a)`. Then
+proceed. Let `f a = Node (Leaf a, Leaf a)`. Then
\tree (. (. (. (. (a1)(a2)))))
\tree (. (. (. (. (a1) (a1)) (. (a1) (a1))) ))
<pre>
- .
- ____|____
- . . | |
-bind __|__ f = __|_ = . .
- | | | | __|__ __|__
- a1 a2 fa1 fa2 | | | |
- a1 a1 a1 a1
+ .
+ ____|____
+ . . | |
+bind __|__ f = __|_ = . .
+ | | | | __|__ __|__
+ a1 a2 fa1 fa2 | | | |
+ a1 a1 a1 a1
</pre>
Now when we bind this tree to `g`, we get
<pre>
- .
- ____|____
- | |
- . .
- __|__ __|__
- | | | |
+ .
+ ____|____
+ | |
+ . .
+ __|__ __|__
+ | | | |
ga1 ga1 ga1 ga1
</pre>
[SearchTree](http://hackage.haskell.org/packages/archive/tree-monad/0.2.1/doc/html/src/Control-Monad-SearchTree.html#SearchTree)
that is intended to
represent non-deterministic computations as a tree.
+
+
+Refunctionalizing zippers: from lists to continuations
+------------------------------------------------------
+
+Let's work with lists of chars for a change. To maximize readability, we'll
+indulge in an abbreviatory convention that "abc" abbreviates the
+list `['a'; 'b'; 'c']`.
+
+Task 1: replace each occurrence of 'S' with a copy of the string up to
+that point.
+
+Expected behavior:
+
+<pre>
+t1 "abSe" ~~> "ababe"
+</pre>
+
+
+In linguistic terms, this is a kind of anaphora
+resolution, where `'S'` is functioning like an anaphoric element, and
+the preceding string portion is the antecedent.
+
+This deceptively simple task gives rise to some mind-bending complexity.
+Note that it matters which 'S' you target first (the position of the *
+indicates the targeted 'S'):
+
+<pre>
+ t1 "aSbS"
+ *
+~~> t1 "aabS"
+ *
+~~> "aabaab"
+</pre>
+
+versus
+
+<pre>
+ t1 "aSbS"
+ *
+~~> t1 "aSbaSb"
+ *
+~~> t1 "aabaSb"
+ *
+~~> "aabaaabab"
+</pre>
+
+versus
+
+<pre>
+ t1 "aSbS"
+ *
+~~> t1 "aSbaSb"
+ *
+~~> t1 "aSbaaSbab"
+ *
+~~> t1 "aSbaaaSbaabab"
+ *
+~~> ...
+</pre>
+
+Aparently, this task, as simple as it is, is a form of computation,
+and the order in which the `'S'`s get evaluated can lead to divergent
+behavior.
+
+For now, as usual, we'll agree to always evaluate the leftmost `'S'`.
+
+This is a task well-suited to using a zipper.
+
+<pre>
+type 'a list_zipper = ('a list) * ('a list);;
+
+let rec t1 (z:char list_zipper) =
+ match z with (sofar, []) -> List.rev(sofar) (* Done! *)
+ | (sofar, 'S'::rest) -> t1 ((List.append sofar sofar), rest)
+ | (sofar, fst::rest) -> t1 (fst::sofar, rest);; (* Move zipper *)
+
+# t1 ([], ['a'; 'b'; 'S'; 'e']);;
+- : char list = ['a'; 'b'; 'a'; 'b'; 'e']
+
+# t1 ([], ['a'; 'S'; 'b'; 'S']);;
+- : char list = ['a'; 'a'; 'b'; 'a'; 'a'; 'b']
+</pre>
+
+Note that this implementation enforces the evaluate-leftmost rule.
+Task 1 completed.
+
+One way to see exactly what is going on is to watch the zipper in
+action by tracing the execution of `t1`. By using the `#trace`
+directive in the Ocaml interpreter, the system will print out the
+arguments to `t1` each time it is (recurcively) called:
+
+<pre>
+# #trace t1;;
+t1 is now traced.
+# t1 ([], ['a'; 'b'; 'S'; 'e']);;
+t1 <-- ([], ['a'; 'b'; 'S'; 'e'])
+t1 <-- (['a'], ['b'; 'S'; 'e'])
+t1 <-- (['b'; 'a'], ['S'; 'e'])
+t1 <-- (['b'; 'a'; 'b'; 'a'], ['e'])
+t1 <-- (['e'; 'b'; 'a'; 'b'; 'a'], [])
+t1 --> ['a'; 'b'; 'a'; 'b'; 'e']
+t1 --> ['a'; 'b'; 'a'; 'b'; 'e']
+t1 --> ['a'; 'b'; 'a'; 'b'; 'e']
+t1 --> ['a'; 'b'; 'a'; 'b'; 'e']
+t1 --> ['a'; 'b'; 'a'; 'b'; 'e']
+- : char list = ['a'; 'b'; 'a'; 'b'; 'e']
+</pre>
+
+The nice thing about computations involving lists is that it's so easy
+to visualize them as a data structure. Eventually, we want to get to
+a place where we can talk about more abstract computations. In order
+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'; 'c']` means (1)
+start with the empty list `[]`; (2) make a new list whose first
+element is 'c' and whose tail is the list construted in the previous
+step; (3) make a new list whose first element is 'b' and whose tail is
+the list constructed in the previous step; and (4) make a new list
+whose first element is 'a' and whose tail is the list constructed in
+the previous step.
+
+What is the type of each of these steps? Well, it will be a function
+from the result of the previous step (a list) to a new list: it will
+be a function of type `char list -> char list`. We'll call each step
+a **continuation** of the recipe. So in this context, a continuation
+is a function of type `char list -> char list`.
+
+This means that we can now represent the sofar part of our zipper--the
+part we've already unzipped--as a continuation, a function describing
+how to finish building the list:
+
+<pre>
+let rec t1c (l: char list) (c: (char list) -> (char list)) =
+ match l with [] -> c []
+ | 'S'::rest -> t1c rest (fun x -> c (c x))
+ | a::rest -> t1c rest (fun x -> List.append (c x) [a]);;
+
+# t1c ['a'; 'b'; 'S'] (fun x -> x);;
+- : char list = ['a'; 'b'; 'a'; 'b']
+
+# t1c ['a'; 'S'; 'b'; 'S'] (fun x -> x);;
+- : char list = ['a'; 'a'; 'b'; 'a'; 'a'; 'b']
+</pre>
+
+Note that we don't need to do any reversing.
+