evaluating call by need on the control stack
play

Evaluating Call-by-need on the Control Stack Stephen Chang, David - PowerPoint PPT Presentation

Nov 04, 2023 •220 likes •1.1k views

Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen Northeastern University Lazy Abstract Machines Sharing implemented with: heap Lazy Abstract Machines Sharing implemented with: heap

  1. Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen Northeastern University �

  2. Lazy Abstract Machines Sharing implemented with: heap �

  3. Lazy Abstract Machines Sharing implemented with: heap stack operations (alternative approach) �

  4. Lazy Abstract Machines Sharing implemented with: heap stack operations (alternative approach) [Garcia et al. 2009] �

  5. Our Paper • New way to resolve variable references in the stack �

  6. Our Paper • New way to resolve variable references in the stack • Reorganize stack structure to allow indexing �

  7. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] �

  8. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed �

  9. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once �

  10. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M ��

  11. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M | (λx.E[x]) E ��

  12. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M [ ] | E M [ ] | E M | (λx.E) M | (λx.E[x]) E [ ] | E M ��

  13. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M (λx.E) M (λx.E) M (λx.E) M | (λx.E[x]) E ��

  14. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M | (λx.E[x]) E (λx.E[x]) E (λx.E[x]) E (λx.E[x]) E ��

  15. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M | (λx.E[x]) E deref (β alternative): (λx.E[x]) V (λx.E[V V V V]) V ��

  16. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M | (λx.E[x]) E deref (β alternative): (λx.E[x]) V (λx.E[V V V V]) V • One-at-a-time substitution (only when needed) ��

  17. Call-by-need λ-Calculus [Ariola et al. 1995] [Ariola and Felleisen 1997] • Delay evaluation of argument until needed • Evaluate each argument only once M = x | M M | λx.M E = [ ] | E M | (λx.E) M | (λx.E[x]) E deref (β alternative): (λx.E[x]) V (λx.E[V V V V]) V • One-at-a-time substitution (only when needed) • Argument not removed (may need it again) ��

  18. An Initial Abstract Machine ��

  19. An Initial Abstract Machine Standard Reduction = abstract machine SR E[N] E[M] if M N ��

  20. An Initial Abstract Machine Standard Reduction = abstract machine SR E[N] E[M] if M N • Re-partition into E and M after every reduction ��

  21. CK Machine [Felleisen 1986] (For by-value λ calculus) • Separate program into two registers: C = Current subterm being evaluated C C C K = Continuation (equiv. to eval. context) K K K ��

  22. CK Machine [Felleisen 1986] (For by-value λ calculus) • Separate program into two registers: C = Current subterm being evaluated C C C K = Continuation (equiv. to eval. context) K K K Don't need to re-partition program after every reduction ��

  23. CK Machine [Felleisen 1986] (For by-value λ calculus) • Separate program into two registers: C = Current subterm being evaluated C C C K = Continuation (equiv. to eval. context) K K K Don't need to re-partition program after every reduction [Garcia et al. 2009] : lazy CK machine ��

  24. Evaluation Contexts (E) vs Continuations (K) [ ] ~ mt E[[ ] M] ~ (arg M K) E ~ K E[(λx.[ ]) M] ~ (bind x M K) E ~ K E[(λx.E'[x]) [ ]] ~ (op x K' K) K' ~ E', K ~ E ��

  25. Evaluation Contexts (E) vs Continuations (K) [ ] ~ mt [ ] ~ mt [ ] ~ mt [ ] ~ mt E[[ ] M] ~ (arg M K) E ~ K E[(λx.[ ]) M] ~ (bind x M K) E ~ K E[(λx.E'[x]) [ ]] ~ (op x K' K) K' ~ E', K ~ E ��

  26. Evaluation Contexts (E) vs Continuations (K) [ ] ~ mt E[[ ] M] ~ (arg M K) E[[ ] M] ~ (arg M K) E[[ ] M] ~ (arg M K) E[[ ] M] ~ (arg M K) E ~ K E[(λx.[ ]) M] ~ (bind x M K) E ~ K E[(λx.E'[x]) [ ]] ~ (op x K' K) K' ~ E', K ~ E ��

  27. Evaluation Contexts (E) vs Continuations (K) [ ] ~ mt E[[ ] M] ~ (arg M K) E ~ K E[(λx.[ ]) M] ~ (bind x M K) E[(λx.[ ]) M] ~ (bind x M K) E[(λx.[ ]) M] ~ (bind x M K) E[(λx.[ ]) M] ~ (bind x M K) E ~ K E[(λx.E'[x]) [ ]] ~ (op x K' K) K' ~ E', K ~ E ��

  28. Evaluation Contexts (E) vs Continuations (K) [ ] ~ mt E[[ ] M] ~ (arg M K) E ~ K E[(λx.[ ]) M] ~ (bind x M K) E ~ K E[(λx.E'[x]) [ ]] ~ (op x K' K) E[(λx.E'[x]) [ ]] ~ (op x K' K) E[(λx.E'[x]) [ ]] ~ (op x K' K) E[(λx.E'[x]) [ ]] ~ (op x K' K) K' ~ E', K ~ E ��

  29. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 ��

  30. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 ��

  31. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 K K K K = mt ��

  32. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) K K K K = (arg M5) mt ��

  33. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λy.(λz.(y M)) M0 M1 M2) M3 M4 K K K K = (bind x M5) mt ��

  34. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λy.(λz.(y M)) M0 M1 M2) M3 K K K K = (arg M4) (bind x M5) mt ��

  35. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λy.(λz.(y M)) M0 M1 M2) K K K K = (arg M3) (arg M4) (bind x M5) mt ��

  36. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λz.(y M)) M0 M1 M2 K K K K = (bind y M3) (arg M4) (bind x M5) mt ��

  37. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λz.(y M)) M0 M1 K K K K = (arg M2) (bind y M3) (arg M4) (bind x M5) mt ��

  38. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λz.(y M)) M0 K K K K = (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt ��

  39. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (λz.(y M)) K = (arg M0) K K K (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt ��

  40. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = (y M) K = (bind z M0) K K K (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt ��

  41. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K = (arg M) K K (bind z M0) (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt ��

  42. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K = (arg M) K K (arg M) (bind z M0) (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt (arg M) (arg M) ��

  43. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K = (arg M) K (bind z M0) (bind z M0) (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt (bind z M0) (bind z M0) ��

  44. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K K = (arg M) (bind z M0) (arg M1) (arg M1) (arg M2) (bind y M3) (arg M4) (bind x M5) mt (arg M1) (arg M1) ��

  45. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K K = (arg M) (bind z M0) (arg M1) (arg M2) (arg M2) (bind y M3) (arg M4) (bind x M5) mt (arg M2) (arg M2) ��

  46. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K = (arg M) K (bind z M0) (arg M1) (arg M2) (bind y M3) (bind y M3) (arg M4) (bind x M5) mt (bind y M3) (bind y M3) ��

  47. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K = (arg M) K (bind z M0) (arg M1) (arg M2) (bind y M3) (bind y M3) (arg M4) (bind x M5) mt (bind y M3) (bind y M3) ��

  48. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K = (arg M) K (bind z M0) (arg M1) (arg M2) (bind y M3) (bind y M3) (arg M4) (bind x M5) mt (bind y M3) (bind y M3) ��

  49. Example (Garcia Machine) (λx.(λy.(λz.(y M)) M0 M1 M2) M3 M4) M5 C C C C = y K K K = (arg M) K (bind z M0) (arg M1) (arg M2) (bind y M3) (bind y M3) (arg M4) (bind x M5) mt (bind y M3) (bind y M3) ��

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call

Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call

Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call Stack higher %rsp holds lowest stack address addresses (address of "top" element) Topics stack grows Procedures toward lower

76 views • 5 slides
Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack instructions Calling conventions Register-saving conventions Why Procedures? Why functions? Why methods? int contains_char(char* haystack,

705 views • 54 slides
Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack instructions Calling conventions Register-saving conventions Why Procedures? Why functions? Why methods? int contains_char(char* haystack,

892 views • 52 slides
Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples

Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples

Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples Call-by-value Pentium implementation Call-by-reference of stack Bubble sort Pentium stack instructions Procedures with variable

668 views • 50 slides
Increasing Addresses Grows Stack Down Stack Pointer: %rsp Stack Top Sean Barker 2

Increasing Addresses Grows Stack Down Stack Pointer: %rsp Stack Top Sean Barker 2

Procedure Call Registers %rax %r8 %eax %r8d Return Arg 5 %rbx %r9 %ebx %r9d Arg 6 %rcx %r10 %ecx %r10d Arg 4 %rdx %r11 %edx %r11d Arg 3 %rsi %r12 %esi %r12d Arg 2 %rdi %r13 %edi %r13d Arg 1 %rsp %r14 %esp %r14d

483 views • 20 slides
x86 Func)on Call Conven)ons 1 Register use in the stack frame %ESP - Stack

x86 Func)on Call Conven)ons 1 Register use in the stack frame %ESP - Stack

x86 Func)on Call Conven)ons 1 Register use in the stack frame %ESP - Stack Pointer This 32-bit register always points to the last element used on the stack. %EBP - Base Pointer This 32-bit register is used to reference all

296 views • 8 slides
Tutorial 5 Overflow Structures Call stack and stack frames 1 CS 136 Spring 2020

Tutorial 5 Overflow Structures Call stack and stack frames 1 CS 136 Spring 2020

Tutorial 5 Overflow Structures Call stack and stack frames 1 CS 136 Spring 2020 Tutorial 4 Overflow: Introduction Any variable in C takes up a certain amount of memory (bits). This limits the range of values that can be

369 views • 19 slides
Evaluating arithmetic expressions Stack-based algorithms are used for syntactical analysis (

Evaluating arithmetic expressions Stack-based algorithms are used for syntactical analysis (

ITI 1121. Introduction to Computing II Marcel Turcotte School of Electrical Engineering and Computer Science Version of February 2, 2013 Abstract Abstract data type: Stack Stack-based algorithms These lecture notes are meant to

1.69k views • 153 slides
CSC 2400: Computer Systems Stack Buffer Overflow Attacks Summary Invoking a function ! CALL

CSC 2400: Computer Systems Stack Buffer Overflow Attacks Summary Invoking a function ! CALL

CSC 2400: Computer Systems Stack Buffer Overflow Attacks Summary Invoking a function ! CALL : call the function ! RET : return from the instruction Stack Frame for a function call includes ! Function arguments ! Return address ! Local

576 views • 15 slides
x86 Assembly Programming under Linux 1 2 Control Flow Instructions Data Movement

x86 Assembly Programming under Linux 1 2 Control Flow Instructions Data Movement

x86 Assembly Programming under Linux 1 2 Control Flow Instructions Data Movement Instructions jmp Jump mov Move cmp Compare push Push stack j condition Conditional Jump pop Pop stack call , ret Subroutine

412 views • 13 slides
(Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from

(Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from

Memory Management in C (Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from the Function Call The top of memory down. Stack Frames sp Code is at the bottom of memory. Available The for Heap

556 views • 39 slides
Programming for Engineers Recursions ICEN 200 Spring 2018 Prof. Dola Saha 1 Function call

Programming for Engineers Recursions ICEN 200 Spring 2018 Prof. Dola Saha 1 Function call

Programming for Engineers Recursions ICEN 200 Spring 2018 Prof. Dola Saha 1 Function call stack and stack frames Stack is analogous to a pile of books Known as last-in, first-out (LIFO) data structures Pop Push Stack of books 2

525 views • 26 slides
(Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from

(Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from

Memory Management in C (Dynamic Strings) Personal Software Engineering Memory Organization The call stack grows from the Function Call The top of memory down. Stack Frames sp Code is at the bottom of memory. Available The

772 views • 39 slides
Towards Nirvana Stack: OpenDaylight Network Control Solution with FD.io Data plane Srikanth

Towards Nirvana Stack: OpenDaylight Network Control Solution with FD.io Data plane Srikanth

Towards Nirvana Stack: OpenDaylight Network Control Solution with FD.io Data plane Srikanth Vavilapalli, Ericsson; Andre Fredette, Redhat OpenStack Summit 2017- Boston Nirvana SDN Stack Applicable Projects Neutron (+Gluon Innovations)

696 views • 16 slides
Attacking the stack (continued) hic 1 1 Firefox bugs this morning hic 2 Last week

Attacking the stack (continued) hic 1 1 Firefox bugs this morning hic 2 Last week

Attacking the stack (continued) hic 1 1 Firefox bugs this morning hic 2 Last week Using buffer overruns or format string attacks to read out or corrupt the stack, esp. the control data on the stack: frame pointers and return

647 views • 42 slides
Workshop X Control Devices and Evaluation 101 The Basics of Evaluating, Selecting and

Workshop X Control Devices and Evaluation 101 The Basics of Evaluating, Selecting and

Workshop X Control Devices and Evaluation 101 The Basics of Evaluating, Selecting and Understanding Common Control Devices Tuesday, March 21, 2017 3:30 p.m. to 4:45 p.m. Biographical Information Arnie T. Beringer, Owner & Managing

892 views • 51 slides
BIND 9 The Past, The Present and The Future Ond ej Sur @ ISC FOSDEM 2018, Brussels

BIND 9 The Past, The Present and The Future Ond ej Sur @ ISC FOSDEM 2018, Brussels

BIND 9 The Past, The Present and The Future Ond ej Sur @ ISC FOSDEM 2018, Brussels BIND 9.0: The Past First released in 2000 Other things from 2000: gcc 2.95.2 Linux kernel 2.4.0 GNOME 1.2 Qt 2.0 Window 2000

802 views • 15 slides
Busy Developer Dr. Jim Webber Chief Scientist, Neo Technology @jimwebber Roadmap Imprisoned

Busy Developer Dr. Jim Webber Chief Scientist, Neo Technology @jimwebber Roadmap Imprisoned

Session code: 6191 A Little Graph Theory for the Busy Developer Dr. Jim Webber Chief Scientist, Neo Technology @jimwebber Roadmap Imprisoned data Graph models Graph theory Local properties, global behaviours Predictive

748 views • 71 slides
AP Chemistry Unit 4: Presentation C Molecular Shapes and Dipole Moments www.njctl.org Slide 3

AP Chemistry Unit 4: Presentation C Molecular Shapes and Dipole Moments www.njctl.org Slide 3

Slide 1 / 30 New Jersey Center for Teaching and Learning Progressive Science Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students and teachers. These materials may not be

320 views • 15 slides
Complexation of 3 ,7 ,12 -trihydroxy-5 -cholan-24-amine by - and -cyclodextrins

Complexation of 3 ,7 ,12 -trihydroxy-5 -cholan-24-amine by - and -cyclodextrins

[f010] Complexation of 3 ,7 ,12 -trihydroxy-5 -cholan-24-amine by - and -cyclodextrins Alvaro Antelo, 1 Mercedes Alvarez Alcalde, 1 Aida Jover, 1 Francisco Meijide, 1 Luciano Galantini 2 and Jos Vzquez Tato 1 1 Departamento de

116 views • 7 slides
61A Lecture 13 Wednesday, September 26 A Function with Behavior That Varies Over Time Let's

61A Lecture 13 Wednesday, September 26 A Function with Behavior That Varies Over Time Let's

61A Lecture 13 Wednesday, September 26 A Function with Behavior That Varies Over Time Let's model a bank account that has a balance of $100 Argument: Return value: amount to withdraw >>> withdraw(25) remaining balance 75

393 views • 14 slides
System-on-Chip Design Introduc6on Hao Zheng Computer Science & Engineering U of South

System-on-Chip Design Introduc6on Hao Zheng Computer Science & Engineering U of South

System-on-Chip Design Introduc6on Hao Zheng Computer Science & Engineering U of South Florida Standard Methodology for IC Design System-level designers write a C or C++ model WriAen in a stylized, hardware-like form SomeEmes

1.08k views • 58 slides
Monads Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer

Monads Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer

Objectives Monads Other Monads Monads Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science Objectives Monads Other Monads Objectives Describe the problem that monads attempt to solve. Know

368 views • 13 slides
Bindex: Naming, Show scope in Racket via lexical contour s in scope diagrams . Free Variables, and

Bindex: Naming, Show scope in Racket via lexical contour s in scope diagrams . Free Variables, and

Review: Scope and Lexical Contours scope = area of program where declared name can be used. Bindex: Naming, Show scope in Racket via lexical contour s in scope diagrams . Free Variables, and Environments (define add-n ( ( x ) (+ n x )) )

449 views • 7 slides

More recommend