Plt-2002-2 11/17/2015 4.8-1 Environment-Passing Interpreters Programming Language Essentials 2nd edition Chapter 3.8 Parameter-Passing Variations.

Slides:



Advertisements
Similar presentations
Plt /7/ Data Abstraction Programming Language Essentials 2nd edition Chapter 2.2 An Abstraction for Inductive Data Types.
Advertisements

Cs784(Prasad)L10Rec1 Implementing Recursion. cs784(Prasad)L10Rec2 let insufficient for recursion ( (let((fact(lambda (n) (if (zero? n) 1 (* n (fact (-
1 Programming Languages (CS 550) Mini Language Interpreter Jeremy R. Johnson.
Assignments and Procs w/Params EOPL3 Chapter 4. Expressible vs. Denotable values Expressible Values –the language can express and compute these –represented.
1 Programming Languages (CS 550) Lecture Summary Functional Programming and Operational Semantics for Scheme Jeremy R. Johnson.
Cs7100(Prasad)L8Interp1 Interpreters Study Semantics of Programming Languages through interpreters (Executable Specifications)
3.6 Interpreter: Recursion Recall Scheme's letrec (recursive let ): > (letrec ((fact (lambda (x) (if (zero? x) 1 (* x (fact (- x 1))))) (fact 6)) 720 Question:
Metacircular Evaluation SICP Chapter 4 Mark Boady.
Cs784(TK)1 Semantics of Procedures and Scopes. Kinds of Scope Static or Lexical scope –determined by structure of program –Scheme, C++, Java, and many.
Lexical vs. Dynamic Scope …where do I point to?. Intro… Remember in Scheme whenever we call a procedure we pop a frame and point it to where the procedure.
6.001 SICP SICP – Evaluation I Recitation 11/19/2004 Eval review Evaluation examples define lambda apply New language elements.
Functional programming: LISP Originally developed for symbolic computing First interactive, interpreted language Dynamic typing: values have types, variables.
SchemeCOP Introduction to Scheme. SchemeCOP Scheme Meta-language for coding interpreters –“ clean ” semantics Scheme = LISP + ALGOL –simple.
The Role of the Study of Programming Languages in the Education of a Programmer Dan Friedman Indiana University.
1 Saves repeated renaming and substitution: explicit substitution is replaced by variable bindings using new data structures (frame, environment). Can.
Closures and Streams More on Evaluations CS784(pm)1.
Cs784(Prasad)L123Assg1 Assignments. cs784(Prasad)L123Assg2 l-value vs. r-value Pascal/Ada: x := x + 1 C/Java: x = x + 1 l-value = location, address, reference,
EOPL3: Section 3.3 PROC and App B: SLLGEN
Environment: Data type associating symbols with values { a: 4s:'foof: x.x } Interface: (empty-env) = [ Ø ] (apply-env [f] s ) = f(s) (extend-env '( s 1...
Cs784(tk)1 Implementing Recursion. Recap: Goals Experimenting with PL design alternatives Scoping, parameter passing, arrays,... Runnable prototype of.
PrasadL145OOL1 Managing Environments An Exercise in the Design, Analysis, Specification, and Implementation of the Core of an OOP Language. Object-Oriented.
Cs7100(Prasad)L8Proc1 Procedures. cs7100(Prasad)L8Proc2 Primitive procedures  etc User-defined procedures –Naming a sequence of operations.
Plt /12/ Data Abstraction Programming Language Essentials 2nd edition Chapter 2.3 Representation Strategies for Data Types.
3.5 Procedures Recall procedures (functions) in Scheme: (let ((f (lambda(y z) (+ y (- z 5))) (f 2 28)) We would like something similar in our toy language:
4.2 Type Checking (type-of-expression > tenv ) = bool (type-of-expression > tenv ) = x ( type-of-expression if > tenv ) = x Recall type of if statement:
SICP Interpretation Parts of an interpreter Arithmetic calculator Names Conditionals and if Storing procedures in the environment Environment as.
1 Objects and types Typed languages = define a set of types in the language and assign a type to each expression in the program Type checking = how can.
Plt /19/ Environment-Passing Interpreters Programming Language Essentials 2nd edition Chapter 3.1 A Simple Interpreter.
Compiler (javac) vs. Interpreter (drscheme): Chapter 3: Environment-Passing Interpreters Front End Interpreter program textsyntax tree answer > ((lambda.
3.3 Conditional Evaluation --> if 1 then 2 else 3 2 Want to support if/then/else We'll represent false as 0, true as 1: Syntax (BNF): ::= if then else.
Objects and Classes Gul Agha CS 421 Spring /11/2001CS 322 Fall Characteristics of OOP Object-based  encapsulate state  provide interface.
Cs784 (Prasad)L6AST1 Abstract Syntax. cs784 (Prasad)L6AST2 Language of -expressions ::= | (lambda ( ) ) | ( ) E.g., concrete syntax Scheme S-expressions.
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
Abstract Syntax cs7100 (Prasad) L7AST.
6.001 SICP Variations on a Scheme
6.001 SICP Compilation Context: special purpose vs. universal machines
The interpreter.
Introduction to Scheme
Interpreters Study Semantics of Programming Languages through interpreters (Executable Specifications) cs7100(Prasad) L8Interp.
September 4, 1997 Programming Languages (CS 550) Lecture 6 Summary Operational Semantics of Scheme using Substitution Jeremy R. Johnson TexPoint fonts.
Implementing Recursion
Env. Model Implementation
Original material by Eric Grimson
Semantics of PLs via Interpreters: Getting Started
The Metacircular Evaluator
Abstract Syntax Prabhaker Mateti 1.
Dynamic Scoping Lazy Evaluation
The Metacircular Evaluator
Procedures App B: SLLGEN 1.
3.7 Variable Assignment Recall instance variables in Python:
3.4 Local Binding Recall Scheme's let: > (let ((x 5)‏ (y 6))
Lecture 27: In Praise of Idleness CS200: Computer Science
Lecture 26: The Metacircular Evaluator Eval Apply
6.001 SICP Further Variations on a Scheme
Streams, Delayed Evaluation and a Normal Order Interpreter
Abstract Syntax cs7100 (Prasad) L7AST.
3.6 Interpreter: Recursion
6.001 SICP Variations on a Scheme
Chapter 3: Environment-Passing Interpreters
Assignments cs7100(Prasad) L13Assg.
6.001 SICP Interpretation Parts of an interpreter
Assignments and Procs w/Params
topics interpreters meta-linguistic abstraction eval and apply
Recursive Procedures and Scopes
Rehearsal: Lazy Evaluation Infinite Streams in our lazy evaluator
Principles of Programming Languages
Lecture 25: The Metacircular Evaluator Eval Apply
Presentation transcript:

plt /17/ Environment-Passing Interpreters Programming Language Essentials 2nd edition Chapter 3.8 Parameter-Passing Variations

plt /17/ Extended Language program: expr expr: number | id | primitive '(' expr *',' ')' | 'if' expr 'then' expr 'else' expr | 'let' (id '=' expr)* 'in' expr | 'proc' '(' id *',' ')' expr | '(' expr expr* ')' | 'letrec' ( id '(' id *',' ')' '=' expr )* 'in' expr | 'set' id '=' expr | 'begin' expr ( ';' expr )* 'end' begin-exp (exp exps) primitive: '+' | '-' | '*' | 'add1' | 'sub1'

plt /17/ Usage (1) let a = 3 p = proc (x) set x = 4 in begin (p a); a end call-by-value: parameter bound to new location with operand value; a remains 3. call-by-reference: if operand is variable reference, parameter is bound to location with reference to variable’s location; a becomes 4.

plt /17/ Usage (2) let a = 3 b = 4 swap = proc (x, y) let temp = x in begin set x = y; set y = temp end in begin (swap a b); -(a, b) end

plt /17/ Changes scanner: remains unchanged. parser: new rule for expression. This is just for convenience. interpreter: new case for begin-exp, reference now to direct and indirect target s, environment now with targets. Denoted Value = reference (Expressed Value) Expressed Value = number + procval

plt /17/ target (define-datatype target target? (direct-target (expval expval?)) (indirect-target (ref ref-to-direct-target?)) ) (define expval? (lambda (x) (or (number? x) (procval? x)) )

plt /17/ ref-to-direct-target? (define ref-to-direct-target? (lambda (x) (and (reference? x) (cases reference x (a-ref (pos vec) (cases target (vector-ref vec pos) (direct-target (v) #t) (indirect-target (v) #f) ) ) ) ) )

plt /17/ deref (define deref (lambda (ref) (cases target (primitive-deref ref) (direct-target (expval) expval) (indirect-target (ref1) (cases target (primitive-deref ref1) (direct-target (expval) expval) (indirect-target (p) (error 'deref "Illegal reference" ref1) ) ) ) (define primitive-deref ; get value out of vector (lambda (ref) (cases reference ref (a-ref (pos vec) (vector-ref vec pos)) )

plt /17/ setref! (define setref! (lambda (ref expval) (let ((ref (cases target (primitive-deref ref) (direct-target (expval1) ref) (indirect-target (ref1) ref1) )) ) (primitive-setref! ref (direct-target expval)) ) ) ) (define primitive-setref! ; set value in vector (lambda (ref val) (cases reference ref (a-ref (pos vec) (vector-set! vec pos val)) ) ) )

plt /17/ Initial environment (define init-env (lambda () (extend-env '(i v x) (map direct-target '(1 5 10)) (empty-env) ) ) ) every value in the environment has to be coded as target.

plt /17/ environment changes (define extend-env (lambda (syms vals env) (if ((list-of target?) vals) (extended-env-record syms (list->vector vals) env) (error 'extend-env) ) ) ) (define extend-env-recursively (lambda (names idss bodies old-env).. (vector-set! vec pos (direct-target (closure ids body env)) ).. )

plt /17/ Parser (define the-grammar '((program (expression) a-program).. (expression ("begin" expression (arbno ";" expression) "end") begin-exp).. )

plt /17/ Interpreter (1) (define eval-expression (lambda (exp env) (cases expression exp (begin-exp (exp1 exps) (let loop ((acc (eval-expression exp1 env)) (exps exps) ) (if (null? exps) acc (loop (eval-expression (car exps) env) (cdr exps) ) ) ) )..

plt /17/ Interpreter (2) Modify all (sub)expression evaluations:.. (primapp-exp (prim rands) (let ((args (eval-primapp-exp-rands rands env))) (apply-primitive prim args) ) ).. (define eval-primapp-exp-rands (lambda (rands env) (map (lambda (x) (eval-expression x env)) rands)) )

plt /17/ Interpreter (3).. (let-exp (ids rands body) (let ((args (eval-let-exp-rands rands env))) (eval-expression body(extend-env ids args env)) ) ).. (define eval-let-exp-rands (lambda (rands env) (map (lambda (x) (eval-let-exp-rand x env)) rands ) ) ) (define eval-let-exp-rand (lambda (rand env) (direct-target (eval-expression rand env)) )

plt /17/ Interpreter (4).. (app-exp (rator rands) (let ((proc (eval-expression rator env)) (args (eval-rands rands env)).. (define eval-rand ; ensure 1-level indirect (lambda (rand env) (cases expression rand (var-exp (id) (indirect-target (let ((ref (apply-env-ref env id))) (cases target (primitive-deref ref) (direct-target (expval) ref) (indirect-target (ref1) ref1) ) ) ) ) (else (direct-target (eval-expression rand env)) ) )

plt /17/ Strategy (proc (t, u, v, w) (proc (a, b) (proc (x, y, z) set y = 13 x y z a b 6) 3 v) ) a b t u v w

plt /17/ How to execute $ scheme48 -I eopl.image >,load indir-environment.scm >,load 3.8.scm >,load call-by-ref.scm >,load boilerplate.scm > (run " let a = 3 p = proc (x) set x = 4 in begin (p a); a end “) 4 $ cd 3; make 3.8a

plt /17/ Usage (1) let y = 0 g = proc (x, y) begin set y = 2; x end in (g +(y,y) y) call-by-name: parameter bound to thunk returning reference; result is 4. Jensen’s device for accessing arrays in Algol.

plt /17/ Usage (2) let g = let count = 0 in proc () begin set count = add1(count); count end in (proc (x) +(x, x) (g)) call-by-need, lazy evaluation: parameter bound to thunk, replaced on first call; result is 3 by-name, 2 by-need.

plt /17/ Terminology thunk: procedure without arguments encapsulating an operand. freezing, thawing: creating the thunk, evaluating it. memoization: the value of the thunk is cached and returned — works in the absence of side-effects.  -reduction in Lambda Calculus, copy rule: replace procedure call by procedure body; in body replace each parameter by corresponding operand.

plt /17/ Changes scanner: remains unchanged. parser: remains unchanged. interpreter: new thunk - target, created by eval - rand, evaluated — and possibly replaced — by deref. Denoted Value = reference (Expressed Value) Expressed Value = number + procval

plt /17/ target (define-datatype target target? (direct-target (expval expval?)) (indirect-target (ref ref-to-direct-target?)) (thunk-target (exp expression?) (env environment?)) )

plt /17/ ref-to-direct-target? (define ref-to-direct-target? (lambda (x) (and (reference? x) (cases reference x (a-ref (pos vec) (cases target (vector-ref vec pos) (direct-target (v) #t) (indirect-target (v) #f) (thunk-target (exp env) #t) ) ) ) ) )

plt /17/ deref (define deref (lambda (ref) (cases target (primitive-deref ref) (direct-target (expval) expval) (indirect-target (ref1) (cases target (primitive-deref ref1) (direct-target (expval) expval) (indirect-target (p) (error 'deref "Illegal reference" ref1)) (thunk-target (exp env) (eval-thunk ref1)) ) ) (thunk-target (exp env) (eval-thunk ref)) ) ) )

plt /17/ eval-thunk (define eval-thunk (lambda (ref) (cases target (primitive-deref ref) (thunk-target (exp env) (let ((val (eval-expression exp env))) (primitive-setref! ref (direct-target val)) val ) ) (else (eopl:error 'eval-thunk "Impossible!")) ) ) ) call-by-name results if the thunk is not overwritten by the computed value.

plt /17/ setref! (define setref! (lambda (ref expval) (let ((ref (cases target (primitive-deref ref) (direct-target (expval1) ref) (indirect-target (ref1) ref1) (thunk-target (exp env) ref) )) ) (primitive-setref! ref (direct-target expval)) ) ) )

plt /17/ Interpreter — call-by-reference (define eval-rand ; ensure 1-level indirect (lambda (rand env) (cases expression rand (var-exp (id) (indirect-target (let ((ref (apply-env-ref env id))) (cases target (primitive-deref ref) (direct-target (expval) ref) (indirect-target (ref1) ref1))))) (else (direct-target (eval-expression rand env)) ) )

plt /17/ Interpreter — call-by-need (define eval-rand ; ensure 1-level indirect (lambda (rand env) (cases expression rand (lit-exp (datum) (direct-target datum)) ; optimize (proc-exp (ids body) (direct-target (closure ids body env))) (var-exp (id) (indirect-target (let ((ref (apply-env-ref env id))) (cases target (primitive-deref ref) (direct-target (expval) ref) (indirect-target (ref1) ref1) (thunk-target (exp env) ref))))) (else (thunk-target rand env)) ) )

plt /17/ How to execute $ scheme48 -I eopl.image >,load need-environment.scm >,load 3.8.scm >,load call-by-need.scm >,load boilerplate.scm > (run " let y = 0 g = proc (x, y) begin set y = 2; x end in (g +(y,y) y) “) 4 $ cd 3; make 3.8b