* Where they say "reference system," which they use the letter `r` for, that corresponds to what we've been calling "assignments", and have been using the letter `g` for.
-* Where they say `r[x/n]`, that's our `g{x:=n}`, or in OCaml, `fun v -> if v = 'x' then n else g v`.
+* Where they say `r[x/n]`, that's our `g{x:=n}`, or in OCaml, `fun var -> if var = 'x' then n else g var`.
* Their function `g`, which assigns entities from the domain to pegs, corresponds to our store function, which assigns entities to indexes. To avoid confusion, I'll use `r` for assignments, like they do, and avoid using `g` altogether. Instead I'll use `h` for stores. (We can't use `s` because GS&V use that for something else, which they call "information states.")
* At several places they talk about some things being *real extensions* of other things. This confused me at first, because they don't ever define a notion of "real extension." (They do define what they mean by "extensions.") Eventually, it emerges that what they mean is what I'd call a *proper extension*: an extension which isn't identical to the original.
-* Is that enough? If not, here are some [more hints](/hints/assignment_7_hint_2).
+* Is that enough? If not, here are some [more hints](/hints/assignment_7_hint_2). But try to get as far as you can on your own.