X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=zipper-lists-continuations.mdwn;h=7687e657bb60270433c21f3c9b33928d5e41a8c4;hb=339b62e48b39fadd325d9e0dc903430c4a896870;hp=fdfc2a556d1c36cacee72fd5dde5084223f14d68;hpb=db89aab6e40647f64f6f51ed6281c0cbce361550;p=lambda.git diff --git a/zipper-lists-continuations.mdwn b/zipper-lists-continuations.mdwn index fdfc2a55..7687e657 100644 --- a/zipper-lists-continuations.mdwn +++ b/zipper-lists-continuations.mdwn @@ -1,11 +1,14 @@ + +[[!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 ------------------------- @@ -24,9 +27,9 @@ constructor is type 'a reader = env -> 'a -then we can deduce the unit and the bind: +then the choice of unit and bind is natural: - let r_unit (x : 'a) : 'a reader = fun (e : env) -> x + let r_unit (a : 'a) : 'a reader = fun (e : env) -> a 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 @@ -37,63 +40,63 @@ Since the type of the `bind` operator is required to be r_bind : ('a reader) -> ('a -> 'b reader) -> ('b reader) -We can deduce the correct `bind` function as follows: +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) = ... -We have to open up the `u` box and get out the `'a` object in order to +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 objects of type `'a`, the way we open a box in this monad is by applying it to an environment: - .... f (u e) ... + ... f (u e) ... This subexpression types to `'b reader`, which is good. The only problem is that we invented an environment `e` that we didn't already have , so we have to abstract over that variable to balance the books: - fun e -> f (u e) ... + fun e -> f (u e) ... This types to `env -> 'b reader`, but we want to end up with `env -> -'b`. Once again, the easiest way to turn a `'b reader` into a `'b` is to apply it to -an environment. So we end up as follows: +'b`. Once again, the easiest way to turn a `'b reader` into a `'b` is to apply it to an environment. So we end up as follows: - r_bind (u : 'a reader) (f : 'a -> 'b reader) : ('b reader) = f (u e) e + r_bind (u : 'a reader) (f : 'a -> 'b reader) : ('b reader) = + f (u e) e -And we're done. +And we're done. This gives us a bind function of the right type. We can then check whether, in combination with the unit function we chose, it satisfies the monad laws, and behaves in the way we intend. And it does. -[This bind is a condensed version of the careful `let a = u e in ...` +[The bind we cite here is a condensed version of the careful `let a = u e in ...` constructions we provided in earlier lectures. We use the condensed version here in order to emphasize similarities of structure across monads.] -The **State Monad** is similar. We somehow intuit that we want to use -the following type constructor: +The **State Monad** is similar. Once we've decided to use the following type constructor: type 'a state = store -> ('a, store) -So our unit is naturally +Then our unit is naturally: - let s_unit (x : 'a) : ('a state) = fun (s : store) -> (x, s) + let s_unit (a : 'a) : ('a state) = fun (s : store) -> (a, s) -And we deduce the bind in a way similar to the reasoning given above. -First, we need to apply `f` to the contents of the `u` box: +And we can reason our way to the bind function in a way similar to the reasoning given above. First, we need to apply `f` to the contents of the `u` box: let s_bind (u : 'a state) (f : 'a -> 'b state) : 'b state = + ... f (...) ... But unlocking the `u` box is a little more complicated. As before, we need to posit a state `s` that we can apply `u` to. Once we do so, however, we won't have an `'a`, we'll have a pair whose first element is an `'a`. So we have to unpack the pair: - ... let (a, s') = u s in ... (f a) ... + ... let (a, s') = u s in ... (f a) ... Abstracting over the `s` and adjusting the types gives the result: - let s_bind (u : 'a state) (f : 'a -> 'b state) : 'b state = - fun (s : store) -> let (a, s') = u s in f a s' + let s_bind (u : 'a state) (f : 'a -> 'b state) : 'b state = + fun (s : store) -> let (a, s') = u s in f a s' -The **Option Monad** doesn't follow the same pattern so closely, so we +The **Option/Maybe Monad** doesn't follow the same pattern so closely, so we won't pause to explore it here, though conceptually its unit and bind follow just as naturally from its type constructor. @@ -101,10 +104,13 @@ Our other familiar monad is the **List Monad**, which we were told looks like this: type 'a list = ['a];; - l_unit (x : 'a) = [x];; + 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]] @@ -118,17 +124,35 @@ And sure enough, 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 @@ -136,28 +160,27 @@ extra bits embdded in them: 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): - -
-# fun f z -> z;; -- : 'a -> 'b -> 'b =- -Finally, we're getting consistent principle types, 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 (in this case, an int). +principle types of these functions (rather than inferring what the +types should be ourselves): + + # fun f z -> z;; + - : 'a -> 'b -> 'b =-# fun f z -> f 1 z;; -- : (int -> 'a -> 'b) -> 'a -> 'b = -# fun f z -> f 2 (f 1 z);; -- : (int -> 'a -> 'a) -> 'a -> 'a = -# fun f z -> f 3 (f 2 (f 1 z)) -- : (int -> 'a -> 'a) -> 'a -> 'a = -
-# treemonadizer (fun x -> [[x; square x]]) t1;; +# treemonadizer (fun x -> [ [x; square x] ]) t1;; - : int list tree list = [Node (Node (Leaf [2; 4], Leaf [3; 9]), @@ -604,3 +674,242 @@ generalizing the type of the continuation monad to type ('a -> 'b -> 'c) continuation = ('a -> 'b) -> 'c;; +The binary tree monad +--------------------- + +Of course, by now you may have realized that we have discovered a new +monad, the binary tree monad: + ++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));; ++ +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 +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))) ++ . . + __|__ __|__ + | | | | + a1 . fa1 . + _|__ __|__ + | | | | + . a5 . fa5 + bind _|__ f = __|__ + | | | | + . a4 . fa4 + __|__ __|___ + | | | | + a2 a3 fa2 fa3 ++ +Given this equivalence, the right identity law + + Right identity: bind u unit = u + +falls out once we realize that + + bind (Leaf a) unit = unit a = Leaf a + +As for the associative 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 +proceed. Let `f a = Node (Leaf a, Leaf a)`. Then + +\tree (. (. (. (. (a1)(a2))))) +\tree (. (. (. (. (a1) (a1)) (. (a1) (a1))) )) ++ . + ____|____ + . . | | +bind __|__ f = __|_ = . . + | | | | __|__ __|__ + a1 a2 fa1 fa2 | | | | + a1 a1 a1 a1 ++ +Now when we bind this tree to `g`, we get + ++ . + ____|____ + | | + . . + __|__ __|__ + | | | | + ga1 ga1 ga1 ga1 ++ +At this point, it should be easy to convince yourself that +using the recipe on the right hand side of the associative law will +built the exact same final tree. + +So binary trees are a monad. + +Haskell combines this monad with the Option monad to provide a monad +called a +[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: + ++t1 "abSe" ~~> "ababe" ++ + +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'): + ++ t1 "aSbS" + * +~~> t1 "aabS" + * +~~> "aabaab" ++ +versus + ++ t1 "aSbS" + * +~~> t1 "aSbaSb" + * +~~> t1 "aabaSb" + * +~~> "aabaaabab" ++ +versus + ++ t1 "aSbS" + * +~~> t1 "aSbaSb" + * +~~> t1 "aSbaaSbab" + * +~~> t1 "aSbaaaSbaabab" + * +~~> ... ++ +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. + ++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'] ++ +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: + ++# #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'] ++ +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: + ++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'] ++ +Note that we don't need to do any reversing. +