David Evans CS200: Computer Science University of Virginia Computer Science Lecture 18: Think Globally, Mutate Locally.

Slides:



Advertisements
Similar presentations
Class 21: Imperative Programming University of Virginia cs1120 David Evans.
Advertisements

1 Programming Languages (CS 550) Lecture Summary Functional Programming and Operational Semantics for Scheme Jeremy R. Johnson.
Cs1120 Fall 2009 David Evans Lecture 16: Power Analysis.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 3: Rules of Evaluation.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 16: Quicker Sorting.
מבוא מורחב למדעי המחשב בשפת Scheme תרגול 10. Environment Model 3.2, pages
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 31: Types of Types.
1 The Metacircular Evaluator Chapter 4 Section 4.1 We will not cover every little detail in the lectures, so you MUST read Section 4.1 in full.
6.001 SICP SICP – October environment Trevor Darrell 32-D512 Office Hour: W web page:
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 26: In Praise of Idleness.
Fall 2008Programming Development Techniques 1 Topic 18 Environment Model of Evaluation Section 3.2 Acknowledgement: This lecture (and also much of the.
David Evans CS200: Computer Science University of Virginia Computer Science Class 31: Universal Turing Machines.
Cs1120 Fall 2009 David Evans Lecture 20: Programming with State.
Cs1120 Fall 2009 David Evans Lecture 19: Stateful Evaluation.
Lecture 31: Laziness University of Virginia cs1120 Fall 2009 David Evans.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 3: Rules of Evaluation.
David Evans CS200: Computer Science University of Virginia Computer Science Class 17: Mutation M. C. Escher, Day and Night.
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 30: Laziness.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 9: Strange Loops and Sinister Repeaters.
1 The Evaluator. 2 Compiler vs. Interpreter Command Processing Unit The Computer Program in Low Level Machine Language Program in High Level Language.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 29: Typed Scheme MC Escher, Liberation.
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 4: The Value of Everything.
David Evans CS200: Computer Science University of Virginia Computer Science Class 16: Mutation M. C. Escher, Day and Night.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 19: Environments.
1 Lecture 14: Assignment and the Environment Model (EM)
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 18: Mutation M. C. Escher, Day and.
Fall 2008Programming Development Techniques 1 Topic 17 Assignment, Local State, and the Environment Model of Evaluation Section 3.1 & 3.2.
David Evans CS200: Computer Science University of Virginia Computer Science Class 32: The Meaning of Truth.
Lecture 3: Rules of Evaluation CS150: Computer Science
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 4: Programming with Data.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 27: Types of Types “It would appear.
SICP Interpretation part 2 Store operators in the environment Environment as explicit parameter Defining new procedures.
(Thunking about Thunks)
Operational Semantics of Scheme
Lecture 4: Metacircles Eval Apply David Evans
Lecture 17: Environments CS200: Computer Science
Edited by Original material by Eric Grimson
Lecture 4: Evaluation Rules Recursion CS200: Computer Science
The interpreter.
Lecture 7: List Recursion CS200: Computer Science
The Environment Model*
September 4, 1997 Programming Languages (CS 550) Lecture 6 Summary Operational Semantics of Scheme using Substitution Jeremy R. Johnson TexPoint fonts.
Class 19: Think Globally, Mutate Locally CS150: Computer Science
Lecture 8: Recursion Practice CS200: Computer Science
The Metacircular Evaluator
Lecture 11: All Sorts CS200: Computer Science University of Virginia
David Evans Lecture 9: The Great Lambda Tree of Infinite Knowledge and Ultimate Power CS200: Computer Science University.
Lecture 28: Types of Types
The Metacircular Evaluator
Lecture 25: Metalinguistics > (meval '((lambda (x) (* x x)) 4)
6.001 SICP Environment model
Lecture 24: Metalinguistics CS200: Computer Science
Lecture 27: In Praise of Idleness CS200: Computer Science
Lecture 26: The Metacircular Evaluator Eval Apply
Streams, Delayed Evaluation and a Normal Order Interpreter
Lecture 12: Message passing The Environment Model
Lecture 13 - Assignment and the environments model Chapter 3
6.001 SICP Environment model
Lecture 9: The Great Lambda Tree of Knowledge and Power
6.001 SICP Variations on a Scheme
Lecture 14: The environment model (cont
6.001 SICP Interpretation Parts of an interpreter
6.001 SICP Environment model
Lecture 3: Rules of Evaluation CS200: Computer Science
Lecture 13: Assignment and the Environment Model (EM)
topics interpreters meta-linguistic abstraction eval and apply
Lecture 15: Quicker Sorting CS150: Computer Science
Lecture 11: Sorting Grounds and Bubbles
Rehearsal: Lazy Evaluation Infinite Streams in our lazy evaluator
Lecture 25: The Metacircular Evaluator Eval Apply
Presentation transcript:

David Evans CS200: Computer Science University of Virginia Computer Science Lecture 18: Think Globally, Mutate Locally

27 February 2004CS 200 Spring Menu Environments Evaluation Rules Exam 1

27 February 2004CS 200 Spring Environments

27 February 2004CS 200 Spring (define nest (lambda (x) (+ x x)))) > ((nest 3) 4) 8 Does the substitution model of evaluation tell us how to evaluate this?

27 February 2004CS 200 Spring Review: Names, Places, Mutation A name is a place for storing a value. define creates a new place cons creates two new places, the car and the cdr (set! name expr) changes the value in the place name to the value of expr (set-car! pair expr) changes the value in the car place of pair to the value of expr (set-cdr! pair expr) changes the value in the cdr place of pair to the value of expr

27 February 2004CS 200 Spring Lambda and Places (lambda (x) …) also creates a new place named x The passed argument is put in that place > (define x 3) > ((lambda (x) x) 4) 4 > x 3 How are these places different? x : 3 x : 4

27 February 2004CS 200 Spring Location, Location, Location Places live in frames An environment is a pointer to a frame We start in the global environment Application creates a new frame All frames except the global frame have exactly one parent frame

27 February 2004CS 200 Spring Environments global environment > (define x 3) + : # null? : # The global environment points to the outermost frame. It starts with all Scheme primitives. x : 3

27 February 2004CS 200 Spring Procedures global environment > (define double (lambda (x) (+ x x))) + : # null? : # double: ?? x : 3

27 February 2004CS 200 Spring How to Draw a Procedure A procedure needs both code and an environment –We’ll see why soon We draw procedures like this: Environment pointer Code pointer parameters: x body: (+ x x)

27 February 2004CS 200 Spring How to Draw a Procedure (for artists only) Environment pointer x (+ x x) Input parameters (in mouth) Procedure Body

27 February 2004CS 200 Spring Procedures global environment > (define double (lambda (x) (+ x x))) + : # null? : # double: x : 3 parameters: x body: (+ x x)

27 February 2004CS 200 Spring Application Old rule: (Substitution model) Apply Rule 2: Compounds. If the procedure is a compound procedure, evaluate the body of the procedure with each formal parameter replaced by the corresponding actual argument expression value.

27 February 2004CS 200 Spring New Rule: Application 1.Construct a new frame, enclosed in the environment of this procedure 2.Create places in that frame with the names of each parameter 3.Put the values of the parameters in those places 4.Evaluate the body in the new environment

27 February 2004CS 200 Spring Construct a new frame, enclosed in the environment of this procedure 2.Make places in that frame with the names of each parameter 3.Put the values of the parameters in those places 4.Evaluate the body in the new environment global environment > (double 4) 8 + : # double: x : 3 parameters: x body: (+ x x) x : 4 (+ x x) (+ 4 4) 8

27 February 2004CS 200 Spring global environment + : # nest: x : 3 parameter: x body: (lambda (x) (+ x x)) x : 3 (define nest (lambda (x) (+ x x)))) > ((nest 3) 4) ((lambda (x) (+ x x)) 4) x : 4 (+ x x)

27 February 2004CS 200 Spring Evaluation Rule 2 (Names) If the expression is a name, it evaluates to the value associated with that name. To find the value associated with a name, look for the name in the frame pointed to by the evaluation environment. If it contains a place with that name, use the value in that place. If it doesn’t, evaluate the name using the frame’s parent environment as the new evaluation environment. If the frame has no parent, error (name is not a place).

27 February 2004CS 200 Spring evaluate-name (define (evaluate-name name env) (if (null? env) (error “Undefined name: …”) (if (frame-contains name (get-frame env)) (lookup name (get-frame env)) (evaluate-name name (parent-environment (get-frame env)))))) Hmm…maybe we can define a Scheme interpreter in Scheme!

27 February 2004CS 200 Spring Charge Mutation makes evaluation rules more complicated Environment diagrams quickly get complicated – but like substitution evaluations, just follow rules mechanically Now, you really know everything you need to finish PS5. Monday: we will really get to Golden Ages! (don’t worry, we’re still in one)