1
Lecture 14: Assignment and the Environment Model (EM)
2
Primitive Data
• constructor:
(define x 10) creates a new binding for name;
special form
• selectors: x returns value bound to name
• mutators: (set! x "foo") changes the binding for name;
special form
3
Assignment -- set!
• Substitution model -- functional programming:(define x 10)(+ x 5) ==> 15 - expression has same value... each time it evaluated (in(+ x 5) ==> 15 same scope as binding)
• With assignment:(define x 10)(+ x 5) ==> 15 - expression "value" depends... on when it is evaluated(set! x 94)...(+ x 5) ==> 99
4
Why? To have objects with local state
•State is summarized in a set of variables.
•When the object change state the variable change value.
5
Example: A counter
(define make-counter (lambda (n) (lambda () (set! n (+ n 1)) n )))
(define ca (make-counter 0))
Can you figure out why this code works?
(ca) ==> 1(ca) ==> 2
(cb) ==> 1
(ca) ==> 3
(define cb (make-counter 0))
ca and cb are independent
6
Lets try to understand this
(define make-counter (lambda (n) (lambda () (set! n (+ n 1)) n )))
(define ca (make-counter 0))
ca ==> (lambda () (set! n (+ 0 1)) 0)
(ca)
(set! n (+ 0 1) 0)
==> ??
7
Summary
• Scheme provides built-in mutators•set! to change a binding
• Mutation introduces substantial complexity !!• Unexpected side effects• Substitution model is no longer sufficient to explain
behavior
8
Another thing the substitution model did not explain well:
• Nested definitions : block structure
(define (sqrt x) (define (good-enough? guess x) (< (abs (- (square guess) x)) 0.001)) (define (improve guess x) (average guess (/ x guess))) (define (sqrt-iter guess x) (if (good-enough? guess x) guess (sqrt-iter (improve guess x) x))) (sqrt-iter 1.0 x))
9
The Environment Model
10
What the EM is:
• A precise, completely mechanical description of:
• name-rule looking up the value of a variable
• define-rule creating a new definition of a var
• set!-rule changing the value of a variable
• lambda-rule creating a procedure
• application applying a procedure
•Basis for implementing a scheme interpreter•for now: draw EM state with boxes and pointers•later on: implement with code
•Enables analyzing arbitrary scheme code:•Example: make-counter
11
A shift in viewpoint
• As we introduce the environment model, we are going to shift our viewpoint on computation
• Variable: • OLD – name for value• NEW – place into which one can store things
• Procedure:• OLD – functional description• NEW – object with inherited context
12
Frame: a table of bindings
• Binding: a pairing of a name and a value
Example: x is bound to 15 in frame A y is bound to (1 2) in frame A the value of the variable x in frame A is 15
21
x: 15
A
y:
13
Environment: a sequence of frames
• Environment E1 consists of frames A and B
z: 10
B
E1
E2
x: 15
A
21
y:
this arrow is calledthe enclosing
environment pointer
• Environment E2 consists of frame B only• A frame may be shared by multiple environments
14
Evaluation in the environment model
• All evaluation occurs in an environment
• The current environment changes when the
interpreter applies a procedure
•To evaluate a combination•Evaluate the subexpressions in the current environment•Apply the value of the first to the values of the rest
•The top environment is called the global environment (GE)•Only the GE has no enclosing environment
15
Name-rule
• A name X evaluated in environment E givesthe value of X in the first frame of E where X is bound
x: 15A
21
z: 10x: 3
B
E1
GE
y:
• In E1, the binding of x in frame A shadows the binding of x in B
•x | GE ==> 3
•z | GE ==> 10 z | E1 ==> 10 x | E1 ==> 15
16
Define-rule
• A define special form evaluated in environment Ecreates or replaces a binding in the first frame of E
(define z 25) | E1(define z 20) | GE
z: 25
z: 20
x: 15A
21
z: 10x: 3
B
E1
GE
y:
17
(set! z 25) | E1
Set!-rule
• A set! of variable X evaluated in environment E changes the binding of X in the first frame of E where X is bound
(set! z 20) | GE
20 25
x: 15A
21
z: 10x: 3
B
E1
GE
y:
18
Your turn: evaluate the following in order
(+ z 1) | E1 ==>
(set! z (+ z 1)) | E1 (modify EM)
(define z (+ z 1)) | E1 (modify EM)
(set! y (+ z 1)) | GE (modify EM)
x: 15A
21
z: 10x: 3
B
E1
GE
y:
11
11
z: 12
Error:unbound variable: y
19
Double bubble: how to draw a procedure
(lambda (x) (* x x))eval
lambda-rule
A compound procthat squares its
argument
#[compound-...]pr
int
Environmentpointer
Code pointer
parameters: xbody: (* x x)
20
Lambda-rule
• A lambda special form evaluated in environment Ecreates a procedure whose environment pointer is E
x: 15A
z: 10x: 3
B
E1
parameters: xbody: (* x x)
square:
(define square (lambda (x) (* x x))) | E1
environment pointerpoints to frame A
because the lambdawas evaluated in E1
and E1 AEvaluating a lambda actually returns a pointer to the procedure object
21
To apply a compound procedure P to arguments:
1. Create a new frame A
2. Make A into an environment E: A's enclosing environment pointer goes to the same frame as the environment pointer of P
3. In A, bind the parameters of P to the argument values
4. Evaluate the body of P with E as the current environment
You mustmemorize these
four steps
22
(square 4) | GE
x: 10GE
parameters: xbody: (* x x)
square:
A
E1 x: 4
(* x x) | E1
*: #[prim]
==> 16
* | E1 ==> #[prim] x | E1 ==> 4
square | GE ==> #[proc]
23
Example: inc-square
GE
p: xb: (* x x)
square:inc-square:
p: yb: (+ 1 (square y))
(define square (lambda (x) (* x x))) | GE(define inc-square (lambda (y) (+ 1 (square y))) | GE
24
Example cont'd: (inc-square 4) | GE
GE
p: xb: (* x x)
square:inc-square:
p: yb: (+ 1 (square y))
E1y: 4
(+ 1 (square y)) | E1
+ | E1 ==> #[prim]
inc-square | GE ==> #[compound-proc ...]
(square y) | E1
25
Example cont'd: (square y) | E1
E2x: 4
(* x x) | E2
* | E2 ==> #[prim] x | E2 ==> 4
GE
p: xb: (* x x)
square:inc-square:
p: yb: (+ 1 (square y))
E1y: 4
==> 16 (+ 1 16) ==> 17
y | E1 ==> 4square | E1 ==> #[compound]
26
Lessons from the inc-square example
• EM doesn't show the complete state of the interpreter• missing the stack of pending operations
• The GE contains all standard bindings (*, cons, etc)• omitted from EM drawings
• Useful to link environment pointer of each frame to the procedure that created it
27
Example: make-counter
• Counter: something which counts up from a number
(define make-counter (lambda (n) (lambda () (set! n (+ n 1)) n )))
(define ca (make-counter 0))(ca) ==> 1(ca) ==> 2(define cb (make-counter 0))(cb) ==> 1(ca) ==> 3(cb) ==> 2 ; ca and cb are independent
28
(define ca (make-counter 0)) | GE
GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 0
(lambda () (set! n (+ n 1)) n) | E1
p: b:(set! n (+ n 1)) n
ca:
environment pointerpoints to E1
because the lambdawas evaluated in E1
29
(ca) | GE
(set! n (+ n 1)) | E2
1
n | E2 ==> 1
E2empty
GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 0
p: b:(set! n (+ n 1)) n
ca:
==> 1
30
E3
(ca) | GE
(set! n (+ n 1)) | E3
GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 0
p: b:(set! n (+ n 1)) n
ca:
1
n | E3 ==> 2
empty
==> 2
2
31
(define cb (make-counter 0)) | GE
(lambda () (set! n (+ n 1)) n) | E4
n: 0E4
p: b:(set! n (+ n 1)) n
cb:GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 2
p: b:(set! n (+ n 1)) n
ca:
E3
32
(cb) | GE
1n: 0
E4
p: b:(set! n (+ n 1)) n
cb:GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 2
p: b:(set! n (+ n 1)) n
ca:
E2
==> 1
E5
33
Capturing state in local frames & procedures
n: 1E4
p: b:(set! n (+ n 1)) n
cb:GE
p: nb:(lambda () (set! n (+ n 1)) n)
make-counter:
E1n: 2
p: b:(set! n (+ n 1)) n
ca:
E2
34
Lessons from the make-counter example
• Environment diagrams get complicated very quickly• Rules are meant for the computer to follow,
not to help humans
• A lambda inside a procedure body captures theframe that was active when the lambda was evaluated
• this effect can be used to store local state