--- /dev/null
+
+* At the top of p. 13 (this is in between defs 2.8 and 2.9), GS&V give two examples, one for \[[∃xPx]] and the other for \[[Qx]]. In fact it will be most natural to break \[[∃xPx]] into two pieces, \[[∃x]] and \[[Px]]. But first we need to get clear on expressions like \[[Px]].
+
+* GS&V say that the effect of updating an information state `s` with the meaning of "Qx" should be to eliminate possibilities in which the entity associated with the peg associated with the variable `x` does not have the property Q. In other words, if we let `Q` be a function from entities to `bool`s, `s` updated with \[[Qx]] should be `s` filtered by the function `fun (r, h) -> let obj = List.nth h (r 'x') in Q obj`. When `... Q obj` evaluates to `true`, that `(r, h)` pair is retained, else it is discarded.
+
+ OK, we face two questions then. First, how do we carry this over to our present framework, where we're working with sets of `dpm`s instead of sets of discourse possibilities? And second, how do we decompose the behavior here ascribed to \[[Qx]] into some meaning for "Q" and a different meaning for "x"?
+
+* Answering the first question: we assume we've got some `(bool dpm) set` to start with. I won't call this `s` because that's what GS&V use for sets of discourse possibilities, and we don't want to confuse discourse possibilities with `dpm`s. Instead I'll call it `u`. Now what we want to do with `u` is to apply a filter that only lets through those `bool dpm`s whose outputs are `(true, r, h)`, where the entity that `r` and `h` associate with variable `x` has the property P. So what we want is:
+
+ let test = (fun (truth_value, r, h) ->
+ truth_value && (let obj = List.nth h (r 'x') in Q obj))
+ in List.filter test u
+
+ Persuade yourself that in general:
+
+ List.filter (test : 'a -> bool) (u : 'a set) : 'a set
+
+ is the same as:
+
+ bind_set u (fun a -> if test a then unit_set a else empty_set)
+
+ Hence substituting in our above formula, we can derive:
+
+ let test = (fun (truth_value, r, h) ->
+ truth_value && (let obj = List.nth h (r 'x') in Q obj))
+ in bind_set u (fun a -> if test a then unit_set a else empty_set)
+
+ or simplifying:
+
+ bind_set u (fun (truth_value, r, h) ->
+ if truth_value && (let obj = List.nth h (r 'x') in Q obj)
+ then unit_set (true, r, h) else empty_set)
+
+ We can call the `(fun (truth_value, r, h) -> ...)` part \[[Qx]] and then updating `u` with \[[Qx]] will be:
+
+ bind_set u \[[Qx]]
+
+ or as it's written using Haskell's infix notation for bind:
+
+ u >>= \[[Qx]]
+
+* Now our second question: how do we decompose the behavior here ascribed to \[[Qx]] into some meaning for "Q" and a different meaning for "x"?
+
+ Well, we already know that \[[x]] will be a kind of computation that takes an assignment function `r` and store `h` as input. It will look up the entity that those two together associate with the variable `x`. So we can treat \[[x]] as an `entity dpm`. Except that we don't have just one `dpm` to compose it with, but a set of them. However, we'll leave that to our predicates to deal with. We'll just make \[[x]] be an operation on a single `dpm`. Let's call the `dpm` we start with `v`. Then what we want to do is:
+
+ let getx = fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in (obj, r, h)
+ in bind_dpm v (fun _ -> getx)
+
+ What's going on here? Our starting `dpm` is a kind of monadic box. We don't care what value is inside that monadic box, which is why we're binding it to a function of the form `fun _ -> ...`. What we return is a new monadic box, which takes `(r, h)` as input and returns the entity they associate with variable `x` (together with unaltered versions of `r` and `h`).
+
+* Now what do we do with predicates? We suppose we're given a function Q that maps entities to `bool`s. We want to turn it into a function that maps `entity dpm`s to `bool dpm`s. Eventually we'll need to operate not just on single `dpm`s but on sets of them, but first things first. We'll begin by lifting Q into a function that takes `entity dpm`s as arguments and returns `bool dpm`s:
+
+ fun entity_dpm -> bind_dpm entity_dpm (fun e -> unit_dpm (Q e))
+
+ Now we have to transform this into a function that again takes single `entity dpm`s as arguments, but now returns a `(bool dpm) set`. This is easily done with `unit_set`:
+
+ fun entity_dpm -> unit_set (bind_dpm entity_dpm (fun e -> unit_dpm (Q e)))
+
+ If we let that be \[[Q]], then \[[Q]] \[[x]] would be:
+
+ let getx = fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in (obj, r, h)
+ in let entity_dpm = getx
+ in unit_set (bind_dpm entity_dpm (fun e -> unit_dpm (Q e)))
+
+ or, simplifying:
+
+ let getx = fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in (obj, r, h)
+ in unit_set (bind_dpm getx (fun e -> unit_dpm (Q e)))
+
+ which is:
+
+ let getx = fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in (obj, r, h)
+ in fun (r, h) ->
+ let (a, r', h') = getx (r, h)
+ in let u' = (fun e -> unit_dpm (Q e)) a
+ in unit_set (u' (r', h'))
+
+ which is:
+
+ fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in let (a, r', h') = (obj, r, h)
+ in let u' = (fun e -> unit_dpm (Q e)) a
+ in unit_set (u' (r', h'))
+
+ which is:
+
+ fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in let u' = unit_dpm (Q obj)
+ in unit_set (u' (r, h))
+
+ which is:
+
+ fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in unit_set (unit_dpm (Q obj) (r, h))
+
+ which is:
+
+ fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in unit_set ((Q obj, r, h))
+
+
+
+
+
+
+
+
+, so really \[[x]] will need to be a monadic operation on *a set of* `entity dpm`s. But one thing at a time. First, let's figure out what operation should be performed on each starting `dpm`. Let's call the `dpm` we start with `v`. Then what we want to do is:
+
+
+ So that's how \[[x]] should operate on a single `dpm`. How should it operate on a set of them? Well, we just have to take each member of the set and return a `unit_set` of the operation we perform on each of them. The `bind_set` operation takes care of joining all those `unit_set`s together. So, where `u` is the set of `dpm`s we start with, we have:
+
+ let handle_each = fun v ->
+ (* as above *)
+ let getx = fun (r, h) ->
+ let obj = List.nth h (r 'x')
+ in (obj, r, h)
+ in let result = bind_dpm v (fun _ -> getx)
+ (* we return a unit_set of each result *)
+ in unit_set result
+ in bind_set u handle_each
+
+ This is a computation that takes a bunch of `_ dpm`s and returns `dpm`s that return their input discourse possibilities unaltered, together with the entity those discouse possibilities associate with variable 'x'. We can take \[[x]] to be the `handle_each` function defined above.
+
+
+* They say the denotation of a variable is the entity which the store `h` assigns to the index that the assignment function `r` assigns to the variable. In other words, if the variable is `'x'`, its denotation wrt `(r, h, w)` is `h[r['x']]`. In our OCaml implementation, that will be `List.nth h (r 'x')`.
+
+
+
+* Now how shall we handle \[[∃x]]. As we said, GS&V really tell us how to interpret \[[∃xPx]], but what they say about this breaks naturally into two pieces, such that we can represent the update of `s` with \[[∃xPx]] as:
+
+ <pre><code>s >>= \[[∃x]] >>= \[[Px]]
+ </code></pre>
+
+ What does \[[∃x]] need to be here? Here's what they say, on the top of p. 13:
+
+ > Suppose an information state `s` is updated with the sentence ∃xPx. Possibilities in `s` in which no entity has the property P will be eliminated.
+
+ We can defer that to a later step, where we do `... >>= \[[Px]]`.
+
+ > The referent system of the remaining possibilities will be extended with a new peg, which is associated with `x`. And for each old possibility `i` in `s`, there will be just as many extensions `i[x/d]` in the new state `s'` and there are entities `d` which in the possible world of `i` have the property P.
+
+ Deferring the "property P" part, this says:
+
+ <pre><code>s updated with \[[∃x]] ≡
+ s >>= (fun (r, h) -> List.map (fun d -> newpeg_and_bind 'x' d) domain)
+ </code></pre>
+
+ That is, for each pair `(r, h)` in `s`, we collect the result of extending `(r, h)` by allocating a new peg for entity `d`, for each `d` in our whole domain of entities (here designated `domain`), and binding the variable `x` to the index of that peg.
+
+ A later step can then filter out all the possibilities in which the entity `d` we did that with doesn't have property P.
+
+ So if we just call the function `(fun (r, h) -> ...)` above \[[∃x]], then `s` updated with \[[∃x]] updated with \[[Px]] is just:
+
+ <pre><code>s >>= \[[∃x]] >>= \[[Px]]
+ </code></pre>
+
+ or, being explicit about which "bind" operation we're representing here with `>>=`, that is:
+
+ <pre><code>bind_set (bind_set s \[[∃x]]) \[[Px]]
+ </code></pre>
+
+* In def 3.1 on p. 14, GS&V define `s` updated with \[[not φ]] as:
+
+ > { i &elem; s | i does not subsist in s[φ] }
+
+ where `i` *subsists* in <code>s[φ]</code> if there are any `i'` that *extend* `i` in <code>s[φ]</code>.
+
+ Here's how we can represent that:
+
+ <pre><code>bind_set s (fun (r, h) ->
+ let u = unit_set (r, h)
+ in let descendents = u >>= \[[φ]]
+ in if descendents = empty_set then u else empty_set
+ </code></pre>
+
+