tail recursion
play

Tail Recursion Dr. Mattox Beckman University of Illinois at - PowerPoint PPT Presentation

Jan 02, 2023 •249 likes •558 views

Objectives Accumulating Recursion Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  1. Objectives Accumulating Recursion Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  2. Objectives Accumulating Recursion Objectives ▶ Understand what makes a function tail recursive. ▶ Explain how the compiler makes tail recursion efficient. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  3. Objectives Accumulating Recursion Tail Calls Tail Position A subexpression s of expressions e , if it is evaluated, will be taken as the value of e . ▶ if x > 3 then x + 2 else x - 4 ▶ f (x * 3) — no (proper) tail position here. Tail Call A function call that occurs in tail position. ▶ if h x then h x else x + g x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  4. | odd n = calc (n*3+1) (i+1) | otherwise = calc (n `div` 2) (i+1) Objectives Accumulating Recursion Your Turn Find the tail calls! Example Code 1 calc n i | n==2 = i 2 3 4 5 fib 0 = 0 6 fib 1 = 1 7 fib n = fib (n-1) + fib (n-2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  5. Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  6. ret 1 x Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  7. ret 2 y ret 1 x Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  8. ret 2 1 ret y x ret z 3 Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  9. 30 ret 1 ret y 2 x z 3 ret Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  10. 30 ret 1 ret y 2 30 x 3 z ret Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  11. 30 ret x 1 y 2 30 ret 30 z 3 ret Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  12. 30 2 ret x 3 1 z 30 30 ret ret 30 y Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  13. 30 ret x 1 ret 30 y 2 30 30 3 30 ret z Objectives Accumulating Recursion Tail Call Example ▶ If one function calls another in tail position, we get a special behavior. Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ What happens when we call foo 1 ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  14. Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  15. ret 1 x Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  16. ret ret 2 x y 1 Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  17. ret x 3 z ret 2 y ret 1 Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  18. 30 ret x ret y 2 1 3 ret z Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  19. 30 2 x 30 ret 30 y 1 ret z 3 ret Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  20. Objectives Accumulating Recursion The Tail Call Optimization Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ If that’s the case, we can cut out the middle man... ▶ Actually, we can do even better than that. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  21. Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  22. ret 1 x Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  23. ret 2 y Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  24. ret 3 z Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  25. 30 ret 3 z Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  26. 30 ret 3 z Objectives Accumulating Recursion The optimization ▶ When a function is in tail position, the compiler will recycle the activation record ! Example 1 foo x = bar (x+1) 2 bar y = baz (y+1) 3 baz z = z * 10 ▶ This allows recursive functions to be written as loops internally. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

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

Tail Recursion and Accumulators Recursion Should now be

Tail Recursion and Accumulators Recursion Should now be

Tail Recursion and Accumulators Recursion Should now be comfortable with recursion: No harder than using a loop (Maybe?) OAen much easier than

346 views • 24 slides
Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop

Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop

Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop functions are implemented recursively Typical function setup: Error-check parameters Check for base cases Handle general/recursive cases

429 views • 11 slides
More Recursion! Recursion - examples Problem: given a string as input, return the string

More Recursion! Recursion - examples Problem: given a string as input, return the string

More Recursion! Recursion - examples Problem: given a string as input, return the string with characters reversed. Base case? Recursion http://xkcd.com/688/ http://xkcd.com/981/ Tail recursion Tail recursion Tail recursion is

332 views • 7 slides
CS161 Recursion Continued Tail recursion n Tail recursion is a recursive call that occurs as

CS161 Recursion Continued Tail recursion n Tail recursion is a recursive call that occurs as

CS161 Recursion Continued Tail recursion n Tail recursion is a recursive call that occurs as the last action in a method. Tail recursion n Tail recursion is a recursive call that occurs as the last action in a method. n This is tail

449 views • 27 slides
Call Trees (Tail) Recursion Amtoft from Hatcliff s u m l i s t n i l = 0 fun Run-Time

Call Trees (Tail) Recursion Amtoft from Hatcliff s u m l i s t n i l = 0 fun Run-Time

Call Trees (Tail) Recursion Amtoft from Hatcliff s u m l i s t n i l = 0 fun Run-Time Structures | s u m l i s t ( x : : xs ) = x + s u m l i s t xs Accumulators has a linear call-tree Tail Recursion s u m l i s t ( [ 2 , 1 ] )

330 views • 16 slides
Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

CoSc 450: Programming Paradigms 03 Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author calls iteration is more commonly called tail recursion. A good optimizing compiler can convert a

1.79k views • 117 slides
Objectives Tail Recursion Identify expressions that have subexpressions in tail position. Dr.

Objectives Tail Recursion Identify expressions that have subexpressions in tail position. Dr.

aux n a = aux (n - 1) (a * n) where aux 0 a = a Objectives Accumulating Recursion Activity References Objectives Accumulating Recursion Activity References Objectives Tail Recursion Identify expressions that have subexpressions in tail

446 views • 8 slides
Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void

Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void

Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void goToWallRec() { if (!isFacingWall()) { forward(); goToWallRec(); } } P - 1 P - 2 JEM Iteration Object Land WallBuggle Suppose we want to execute a

933 views • 4 slides
Programming Languages Tail Recursion and Accumulators Material adapted from Dan Grossman's PL

Programming Languages Tail Recursion and Accumulators Material adapted from Dan Grossman's PL

Programming Languages Tail Recursion and Accumulators Material adapted from Dan Grossman's PL class, U. Washington Recursion Should now be comfortable with recursion: No harder than using a loop (Maybe?) Often much easier than a loop

680 views • 24 slides
Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration

Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration

Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration via Tail Recursion in Racket How can that be? - Tail recursion! Tail recursive list processing via foldl Other useful abstrac*ons - General

701 views • 10 slides
Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration

Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration

Overview What is itera*on? Racket has no loops, and yet can express itera*on. Iteration via Tail Recursion in Racket How can that be? - Tail recursion! Tail recursive list processing via foldl Other useful abstrac*ons - General

457 views • 13 slides
CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of

CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of

CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of Programming Languages Ben Wood Ben Wood Tail Recursion +tail.rkt https://cs.wellesley.edu/~cs251/s20/ 1 Tail Recursion Topics Recursion is an

414 views • 25 slides
CS 61A Discussion 10 Tail Recursion Albert Xu Slides: albertxu.xyz/teaching/cs61a/ The Cost of

CS 61A Discussion 10 Tail Recursion Albert Xu Slides: albertxu.xyz/teaching/cs61a/ The Cost of

CS 61A Discussion 10 Tail Recursion Albert Xu Slides: albertxu.xyz/teaching/cs61a/ The Cost of Recursion aint no free lunch (define (factorial n) (if (= n 0) 1 (* n (factorial (- n 1))))) scm> (factorial 3) The Cost of Recursion

688 views • 29 slides
Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of

Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of

Objectives Accumulating Recursion Activity References Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science Objectives Accumulating Recursion Activity References Objectives

598 views • 32 slides
Functional Programming in Scala Part II Raj Sunderraman Tail Recursion Evaluating a Function

Functional Programming in Scala Part II Raj Sunderraman Tail Recursion Evaluating a Function

Functional Programming in Scala Part II Raj Sunderraman Tail Recursion Evaluating a Function Application function call f(e1,,en) is evaluated as follows: evaluate expressions e1,,en resulting in values v1,,vn replace f(e1,,en)

211 views • 19 slides
Iteration via Tail Recursion in Racket CS251 Programming Languages Spring 2016, Lyn Turbak

Iteration via Tail Recursion in Racket CS251 Programming Languages Spring 2016, Lyn Turbak

Iteration via Tail Recursion in Racket CS251 Programming Languages Spring 2016, Lyn Turbak Department of Computer Science Wellesley College Overview What is itera*on? Racket has no loops, and

894 views • 39 slides
tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density

tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density

tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density that are far from its mean. PMF for X ~ Bin(100,0.5) 0.08 0.06 P(X=k) 0.04 0.02 0.00 30 40 50 60 70 4 k tail bounds

324 views • 21 slides
The LUX-ZEPLIN Dark Matter Experiment Alden Fan for the LZ collaboration Stanford/KIPAC/SLAC

The LUX-ZEPLIN Dark Matter Experiment Alden Fan for the LZ collaboration Stanford/KIPAC/SLAC

The LUX-ZEPLIN Dark Matter Experiment Alden Fan for the LZ collaboration Stanford/KIPAC/SLAC TAUP 2019 Toyama, Japan 9 September 2019 LZ collaboration 36 institutions, ~250 scientists, engineers, technicians IBS-CUP (Korea) Brandeis

383 views • 27 slides
The Oil & Gas Industry in New Zealand focus on Taranaki Prepared for Community

The Oil & Gas Industry in New Zealand focus on Taranaki Prepared for Community

The Oil & Gas Industry in New Zealand focus on Taranaki Prepared for Community Information Day: Moving on from Oil & Gas in Aotearoa/NZ The Dowse Art Museum, Lower Hutt 25 March 2018 By Catherine Cheung Climate Justice

553 views • 27 slides
Layout Components www.icefaces.org ICESOFT TECHNOLOGIES INC. Component Naming Schemes Here

Layout Components www.icefaces.org ICESOFT TECHNOLOGIES INC. Component Naming Schemes Here

Layout Components www.icefaces.org ICESOFT TECHNOLOGIES INC. Component Naming Schemes Here is the general naming scheme for ICEfaces component tags: Layout Components: panel* Input Components: input* Output Components: output*

908 views • 47 slides
Optimal Aggregation Policy for Web Search Jeong-Min Yun 1 , Yuxiong He 2 , Sameh Elnikety 2 ,

Optimal Aggregation Policy for Web Search Jeong-Min Yun 1 , Yuxiong He 2 , Sameh Elnikety 2 ,

Optimal Aggregation Policy for Web Search Jeong-Min Yun 1 , Yuxiong He 2 , Sameh Elnikety 2 , Shaolei Ren 3 1 POSTECH, 2 Microsoft Research, 3 Florida International University 1 Web Search Architecture Billions of web documents are partitioned

207 views • 18 slides
Graphical Models Graphical Models Conditional Independence 1 Steven J Zeil d-Separation 2

Graphical Models Graphical Models Conditional Independence 1 Steven J Zeil d-Separation 2

Conditional Independence d-Separation Belief Propogation Conditional Independence d-Separation Belief Propogation Graphical Models Graphical Models Conditional Independence 1 Steven J Zeil d-Separation 2 Old Dominion Univ. Fall 2010

556 views • 7 slides
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed

Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed

Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions . Paper #2156 Prashanth L A , Krishna Jagannathan , Ravi Kolla IIT Madras, Chennai, India AB InBev cn 2 One-Slide Summary

394 views • 37 slides
EECS 591 D ISTRIBUTED S YSTEMS Manos Kapritsos Fall 2020 H ANDLING QUERIES query Primary The

EECS 591 D ISTRIBUTED S YSTEMS Manos Kapritsos Fall 2020 H ANDLING QUERIES query Primary The

EECS 591 D ISTRIBUTED S YSTEMS Manos Kapritsos Fall 2020 H ANDLING QUERIES query Primary The primary cannot respond until it has received all acks for prior updates ack ack ack ack ack backups C HAIN REPLICATION Primary replicas Head

588 views • 36 slides

More recommend