From 36c94fedb277747ee71911626d147614df67c031 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Fri, 8 Jul 2022 21:32:40 -0400 Subject: Elaborate more on how lexical scoping creates mutable values --- docs/doc/lexical.html | 28 ++++++++++++++++++++++++++-- docs/doc/oop.html | 2 +- 2 files changed, 27 insertions(+), 3 deletions(-) (limited to 'docs') diff --git a/docs/doc/lexical.html b/docs/doc/lexical.html index 290a2a37..4d34cdae 100644 --- a/docs/doc/lexical.html +++ b/docs/doc/lexical.html @@ -138,8 +138,32 @@ Mul 6 # A new result 30 -

Only code with access to a variable can modify it! This means that if none of the code in a variable's scope modifies it, then the variable is a constant in each environment that contains it (not necessarily across environments). That is, constant once it's defined: remember that it's still possible to get an error if the variable is accessed before being defined.

+

Only source code with access to a variable can modify it! This means that if none of the code in a variable's scope modifies it, then the variable is constant. That is, constant once it's defined: remember that it's still possible to get an error if the variable is accessed before being defined.

↗️
    { { a } ⋄ a←4 }
 Error: Reading variable before its defined
-

With lexical scoping, variable mutation automatically leads to mutable data. This is because a function or modifier that depends on the variable value changes its behavior when the variable changes. For further discussion see the documentation on mutable objects.

+

With lexical scoping, variable mutation automatically leads to mutable data. This is because a function or modifier that depends on the variable value changes its behavior when the variable changes. So do objects; this slightly more concrete case is discussed here. The behavior change is observed by calling operations, and by accessing object fields. These are the only two actions that might behave differently when applied to the same values!

+

Aliasing

+

Mutable values exhibits aliasing. This means that when two variables refer to the same mutable value (or two copies of it exist generally), changes to one also affect the other.

+↗️
    record ← { r←⟨⟩ ⋄ { r ∾↩ <𝕩 } }
+    Record ∞
+⟨ ∞ ⟩
+
+    Record2 ← Record  # Copy the function
+    Record2 "new"
+⟨ ∞ "new" ⟩
+
+    Record 0   # The added value "new" is seen here as well
+⟨ ∞ "new" 0 ⟩
+
+

This could be said to conflict with arrays, where two variables might be copies of the same array but a change to one doesn't affect the other.

+↗️
    copy_a ← copy_b ← "array"
+
+    copy_b 'b'⌾⊑↩
+"brray"
+
+    copy_a
+"array"
+
+

But that's not really what's happening. Aliasing has nothing to do with variables: it's a property of mutation, and there's no such thing as array mutation. 'b'⌾⊑ creates a new but related array. And ↩ changes the value of copy_b, not its value "array". Similarly, if we wrote record2 ↩ @ then nothing would happen to record.

+

You can tell whether two mutable values alias each other using Match (≡), because that's how it defines block equality. However, aliasing isn't the only way one mutable value can affect another: two functions might refer to the same variable, for instance. I think the idea that the function itself is mutable can cause some confusion, and sometimes prefer to think at a lower level—that variables don't belong to the function, but the function just knows about them. So a function is more like a file name (path) than a file. It's a static thing, but using it (calling the function or accessing the file) reads outside information that can change over time.

diff --git a/docs/doc/oop.html b/docs/doc/oop.html index 2e47476c..5915f033 100644 --- a/docs/doc/oop.html +++ b/docs/doc/oop.html @@ -118,7 +118,7 @@

A stack is a particularly simple class to make because its state can be represented efficiently as a BQN value. Other data structures don't allow this, and will often require an extra Node class in an implementation—see MakeQueue below.

Mutability

-

An object is one way to transform variable mutation ↩ into mutable data. These are two different concepts: ↩ changes which value is attached to a name in a scope, while mutable data means that the behavior of a particular value can change. But if a value is linked to a scope (for an object, the scope that contains its fields), then variable mutation in that scope can change the value's behavior. In fact, in BQN this is the only way to create mutable data. Which doesn't mean it's rare: functions, modifiers, and namespaces are all potentially mutable. The difference between objects and the operations is just a matter of syntax. Mutability in operations can only be observed by calling them. For instance F 10 or -_m could return a different result even if the variables involved don't change value. Mutability in an object can only be observed by accessing a member, meaning that obj.field or ⟨field⟩←obj can yield different values over the course of a program even if obj is still the same object.

+

An object is one way to transform variable mutation ↩ into mutable data. These are two different concepts: ↩ changes which value is attached to a name in a scope, while mutable data means that the behavior of a particular value can change. But if a value is linked to a scope (for an object, the scope that contains its fields), then variable mutation in that scope can change the value's behavior. In fact, in BQN this is the only way to create mutable data. Which doesn't mean it's rare: functions, modifiers, and namespaces are all potentially mutable. The difference between objects and the operations is just a matter of syntax. Mutability in operations can only be observed by calling them. For instance F 10 or -_m could return a different result even if the variables involved don't change value. Mutability in an object can only be observed by accessing a member, meaning that obj.field or ⟨field⟩←obj can yield different values over the course of a program even if obj is still the same object.

Let's look at how mutability plays out in an example class for a single-ended queue. This queue works by linking new nodes to the tail t of the queue, and detaching nodes from the head h when requested (a detached node will still point to h, but nothing in the queue points to it, so it's unreachable and will eventually be garbage collected). Each node has some data v and a single node reference n directed tailwards; in a double-ended queue or more complicated structure it would have more references. You can find every mutable variable in the queue by searching for ↩, which shows that t and h in the queue, and n in a node, may be mutated. It's impossible for the other variables to change value once they're assigned.

MakeQueue ← {𝕤
   t←h←e←{SetN⇐{h↩𝕩}}
-- 
cgit v1.2.3