X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week9.mdwn;h=a0c843224b4df706141c26ae13658f07b3701e4c;hp=a44018a4daf846148c70b0255b3f3036c94f57f2;hb=3a24f457b5d8dfe280e95913d3b13d65f31b6fe8;hpb=d12033fdb1da5b834eae6fd41a9cadbb567d62fa
diff --git a/week9.mdwn b/week9.mdwn
index a44018a4..a0c84322 100644
--- a/week9.mdwn
+++ b/week9.mdwn
@@ -217,6 +217,8 @@ At the end, we'll get `(1, 2, 3)`. The reference cell that gets updated when we
Here, too, just as in the OCaml fragment, all the calls to getter and setter are working with a single mutable variable `free_var`.
+If you've got a copy of *The Seasoned Schemer*, which we recommended for the seminar, see the discussion at pp. 91-118 and 127-137.
+
If however you called `factory` twice, you'd have different `getter`/`setter` pairs, each of which had their own, independent `free_var`. In OCaml:
let factory (starting_val : int) =
@@ -429,7 +431,7 @@ Here's how to implement these. We'll suppose that our assignment function is lis
(* evaluate expr2 using original assignment function and new store *)
in eval expr2 g s''
-Note: Chris uses this kind of machinery on the third page of the Nov 22 handout. Except he doesn't implement `Change`, and he adds an implementation of `Alias` (see below). Some minor differences: on his handout (and following Groenendijk, Stockhof and Veltman), he uses `r` and `g` where we use `g` and `s` respectively. Also, he implements his `r` with a function from `char` to `int`, instead of a `(char * int) list`, as we do here. It should be obvious how to translate between these. Finally, and this is somewhat more substantial: he implements `Let(c, expr1, expr2)` not by allocating a new peg for `c` as we do above, but rather by changing the value stored at the peg that his `r` already associates with `c`. Without aliases, it doesn't matter which way you go. With aliases, his method is the way to go, because then all other variables aliased to the same peg will automatically inherit the new value. However, his solution requires that variables always already have an associated peg. So that when we call `Let(c, expr1, expr2)` for the first time with `c`, there's a peg whose value is to be updated. That's easier to ensure when you implement the assignment as a function than as a `(char * int) list`.
+Note: Chris uses this kind of machinery on the third page of the Nov 22 handout. Except he implements `Let` the way we here implement `Change`. And he adds an implementation of `Alias` (see below). Some minor differences: on his handout (and following Groenendijk, Stokhof and Veltman), he uses `r` and `g` where we use `g` and `s` respectively. Also, he implements his `r` with a function from `char` to `int`, instead of a `(char * int) list`, as we do here. It should be obvious how to translate between these. His implementation requires that variables always already have an associated peg. So that when we call `Let(c, expr1, expr2)` for the first time with `c`, there's a peg whose value is to be updated. That's easier to ensure when you implement the assignment as a function than as a `(char * int) list`.
##How to implement mutation with a State monad##
@@ -446,9 +448,9 @@ Here's the implementation of the State monad, together with an implementation of
(* alternatively, an env could be implemented as type char -> int *)
type 'a reader = env -> 'a;;
- let unit_reader (value : 'a) : 'a reader =
+ let reader_unit (value : 'a) : 'a reader =
fun e -> value;;
- let bind_reader (u : 'a reader) (f : 'a -> 'b reader) : 'b reader =
+ let reader_bind (u : 'a reader) (f : 'a -> 'b reader) : 'b reader =
fun e -> let a = u e
in let u' = f a
in u' e;;
@@ -458,9 +460,9 @@ Here's the implementation of the State monad, together with an implementation of
(* this corresponds to having only a single mutable variable *)
type 'a state = store -> ('a, store);;
- let unit_state (value : 'a) : 'a state =
+ let state_unit (value : 'a) : 'a state =
fun s -> (value, s);;
- let bind_state (u : 'a state) (f : 'a -> 'b state) : 'b state =
+ let state_bind (u : 'a state) (f : 'a -> 'b state) : 'b state =
fun s -> let (a, s') = u s
in let u' = f a
in u' s';;
@@ -469,29 +471,29 @@ Notice the similarities (and differences) between the implementation of these tw
With the Reader monad, we also had some special-purpose operations, beyond its general monadic operations. These were `lookup` and `shift`. With the State monad, we'll also have some special-purpose operations. We'll consider two basic ones here. One will be to retrieve what is the current store. This is like the Reader monad's `lookup`, except in this simple implementation there's only a single location for a value to be looked up from. Here's how we'll do it:
- let get_state : store state =
+ let state_get : store state =
fun s -> (s, s);;
This passes through the current store unaltered, and also returns a copy of the store as its value. We can use this operation like this:
- some_existing_state_monad_box >>= fun _ -> get_state >>= (fun cur_store -> ...)
+ some_existing_state_monad_box >>= fun _ -> state_get >>= (fun cur_store -> ...)
The `fun _ ->` part here discards the value wrapped by `some_existing_state_monad_box`. We're only going to pass through, unaltered, whatever *store* is generated by that monadic box. We also wrap that store as *our own value*, which can be retrieved by further operations in the `... >>= ...` chain, such as `(fun cur_store -> ...)`.
The other operation for the State monad will be to update the existing store to a new one. This operation looks like this:
- let set_state (new_store : int) : dummy state =
+ let state_put (new_store : int) : dummy state =
fun s -> (dummy, new_store);;
If we want to stick this in a `... >>= ...` chain, we'll need to prefix it with `fun _ ->` too, like this:
- some_existing_state_monad_box >>= fun _ -> set_state 100 >>= ...
+ some_existing_state_monad_box >>= fun _ -> state_put 100 >>= ...
-In this usage, we don't care what value is wrapped by `some_existing_state_monad_box`. We don't even care what store it generates, since we're going to replace that store with our own new store. A more complex kind of `set_state` operation might insert not just some constant value as the new store, but rather the result of applying some function to the existing store. For example, we might want to increment the current store. Here's how we could do that:
+In this usage, we don't care what value is wrapped by `some_existing_state_monad_box`. We don't even care what store it generates, since we're going to replace that store with our own new store. A more complex kind of `state_put` operation might insert not just some constant value as the new store, but rather the result of applying some function to the existing store. For example, we might want to increment the current store. Here's how we could do that:
- some_existing_state_monad_box >>= fun _ -> get_state >>= (fun cur_store -> set_state (cur_store + 1) >>= ...
+ some_existing_state_monad_box >>= fun _ -> state_get >>= (fun cur_store -> state_put (cur_store + 1) >>= ...
-We can of course define more complex functions that perform the `get_state >>= (fun cur_store -> set_state (cur_store + 1)` as a single operation.
+We can of course define more complex functions that perform the `state_get >>= (fun cur_store -> state_put (cur_store + 1)` as a single operation.
In general, a State monadic **box** (type `'a state`, what appears at the start of a `... >>= ... >>= ...` chain) is an operation that accepts some starting store as input---where the store might be simple as it is here, or much more complex---and returns a value plus a possibly modified store. This can be thought of as a static encoding of some computation on a store, which encoding is used as a box wrapped around a value of type `'a`. (And also it's a burrito.)
@@ -503,6 +505,8 @@ To get the whole process started, the complex computation so defined will need t
in computation initial_store;;
+* See also our [[State Monad Tutorial]].
+
##Aliasing or Passing by reference##
@@ -625,7 +629,22 @@ Programming languages tend to provide a bunch of mutation-related capabilities a
Terminological note: in OCaml, `=` and `<>` express the qualitative (in)discernibility relations, also expressed in Scheme with `equal?`. In OCaml, `==` and `!=` express the numerical (non)identity relations, also expressed in Scheme with `eq?`. `=` also has other syntactic roles in OCaml, such as in the form `let x = value in ...`. In other languages, like C and Python, `=` is commonly used just for assignment (of either of the sorts we've now seen: `let x = value in ...` or `change x to value in ...`). The symbols `==` and `!=` are commonly used to express qualitative (in)discernibility in these languages. Python expresses numerical (non)identity with `is` and `is not`. What an unattractive mess. Don't get me started on Haskell (qualitative discernibility is `/=`) and Lua (physical (non)identity is `==` and `~=`).
- Note that neither of the equality predicates here being considered are the same as the "hyperequals" predicate mentioned above. For example, in the following (fictional) language:
+ Because of the particular way the numerical identity predicates are implemented in all of these languages, it doesn't quite match our conceptual expectations. For instance, For instance, if `ycell` is a reference cell, then `ref !ycell` will always be a numerically distinct reference cell containing the same value. We get this pattern of comparisons in OCaml:
+
+ ycell == ycell
+ ycell != ref !ycell (* true, these aren't numerically identical *)
+
+ ycell = ycell
+ ycell = ref !ycell (* true, they are qualitatively indiscernible *)
+
+ But now what about?
+
+ (0, 1, ycell) ? (0, 1, ycell)
+ (0, 1. ycell) ? (0, 1. ref !ycell)
+
+ You might expect the first pair to be numerically identical too---after all, they involve the same structure (an immutable triple) each of whose components is numerically identical. But OCaml's "physical identity" predicate `==` does not detect that identity. It counts both of these comparisons as false. OCaml's `=` predicate does count the first pair as equal, but only because it's insensitive to numerical identity; it also counts the second pair as equal. This shows up in all the other languages I know, as well. In Python, `y = []; (0, 1, y) is (0, 1, y)` evaluates to false. In Racket, `(define y (box 1)) (eq? (cons 0 y) (cons 0 y))` also evaluates to false (and in Racket, unlike traditional Schemes, `cons` is creating immutable pairs). They chose an implementation for their numerical identity predicates that is especially efficient and does the right thing in the common cases, but doesn't quite match our mathematical expectations.
+
+ Additionally, note that none of the equality predicates so far considered is the same as the "hyperequals" predicate mentioned above. For example, in the following (fictional) language:
let ycell = ref 1
in let xcell = ref 1
@@ -677,7 +696,7 @@ Programming languages tend to provide a bunch of mutation-related capabilities a
in let (adder', setter') = factory 1
in ...
- Of course, in most languages you wouldn't be able to evaluate a comparison like `getter = getter'`, because in general the question whether two functions always return the same values for the same arguments is not decidable. So typically languages don't even try to answer that question. However, it would still be true that `getter` and `getter'` (and `adder` and `adder'`) were extensionally equivalent.
+ Of course, in most languages you wouldn't be able to evaluate a comparison like `getter = getter'`, because in general the question whether two functions always return the same values for the same arguments is not decidable. So typically languages don't even try to answer that question. However, it would still be true that `getter` and `getter'` (and `adder` and `adder'`) were extensionally equivalent; you just wouldn't be able to establish so.
However, they're not numerically identical, because by calling `setter 2` (but not calling `setter' 2`) we can mutate the function value `getter` (and `adder`) so that it's *no longer* qualitatively indiscernible from `getter'` (or `adder'`).
@@ -732,10 +751,13 @@ Programming languages tend to provide a bunch of mutation-related capabilities a
We use the `None`/`Some factorial` option type here just as a way to ensure that the contents of `fact_cell` are of the same type both at the start and the end of the block.
+ If you've got a copy of *The Seasoned Schemer*, which we recommended for the seminar, see the discussion at pp. 118-125.
+
* Now would be a good time to go back and review some material from [[week1]], and seeing how much we've learned. There's discussion back then of declarative or functional languages versus languages using imperatival features, like mutation. Mutation is distinguished from shadowing. There's discussion of sequencing, and of what we mean by saying "order matters."
-In point 7 of the Rosetta Stone discussion, the contrast between call-by-name and call-by-value evaluation order appears (though we don't yet call it that). We'll be discussing that more in coming weeks. In the [[damn]] example, continuations and other kinds of side-effects (namely, printing) make an appearance. These too will be center-stage in coming weeks.
+ In point 7 of the Rosetta Stone discussion, the contrast between call-by-name and call-by-value evaluation order appears (though we don't yet call it that). We'll be discussing that more in coming weeks. In the [[damn]] example, continuations and other kinds of side-effects (namely, printing) make an appearance. These too will be center-stage in coming weeks.
+* Now would also be a good time to read [Calculator Improvements](/week10). This reviews the different systems discussed above, as well as other capabilities we can add to the calculators introduced in [week7](/reader_monad_for_variable_binding). We will be building off of that in coming weeks.
##Offsite Reading##