tail recursion
play

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

May 29, 2023 •261 likes •598 views

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

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

  2. Objectives Accumulating Recursion Activity References Objectives ◮ Identify expressions that have subexpressions in tail position. ◮ Explain the tail call optimization. ◮ Convert a direct style recursive function into an equivalent tail recursive function.

  3. Objectives Accumulating Recursion Activity References Tail Calls Tail Position A subexpression s of expressions e , if it is evaluated, will be taken as the value of e . Consider this code: ◮ 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. aux n a = aux (n - 1) (a * n) where aux 0 a = a Objectives Accumulating Recursion Activity References Your Turn Find the tail calls! Example Code 1 fact1 0 = 1 2 fact1 n = n * fact1 (n - 1) 3 4 fact2 n = aux n 1 5 6 7 8 fib 0 = 0 9 fib 1 = 1 10 fib n = fib (n - 1) + fib (n - 2)

  5. Objectives Accumulating Recursion Activity References 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. 1 x ret Objectives Accumulating Recursion Activity References 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 x 2 y ret 1 Objectives Accumulating Recursion Activity References 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 x 3 z ret 2 y ret 1 Objectives Accumulating Recursion Activity References 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 x ret 3 z ret 2 y ret 1 Objectives Accumulating Recursion Activity References 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 1 ret 3 z ret 30 2 y ret x Objectives Accumulating Recursion Activity References 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 1 ret 3 z 30 ret 30 2 y ret x Objectives Accumulating Recursion Activity References 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 30 ret 3 z 30 ret 30 2 y ret 1 x Objectives Accumulating Recursion Activity References 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 30 ret 3 z 30 ret 30 2 y 30 ret 1 x Objectives Accumulating Recursion Activity References 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 Activity References 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. x 1 ret Objectives Accumulating Recursion Activity References 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. x 1 ret y 2 ret Objectives Accumulating Recursion Activity References 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 Activity References 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 1 ret 3 z ret 2 y ret x Objectives Accumulating Recursion Activity References 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 30 ret 3 z ret 2 y 30 ret 1 x Objectives Accumulating Recursion Activity References 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 Activity References 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 Activity References 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. x 1 ret Objectives Accumulating Recursion Activity References 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. y 2 ret Objectives Accumulating Recursion Activity References 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. z 3 ret Objectives Accumulating Recursion Activity References 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. z 3 ret 30 Objectives Accumulating Recursion Activity References 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. z 3 ret 30 Objectives Accumulating Recursion Activity References 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.

  27. Objectives Accumulating Recursion Activity References Direct-Style Recursion ◮ In recursion, you split the input into the “fjrst piece” and the “rest of the input.” ◮ In direct-style recursion: the recursive call computes the result for the rest of the input, and then the function combines the result with the fjrst piece. ◮ In other words, you wait until the recursive call is done to generate your result. Direct Style Summation 1 sum [] = 0 2 sum (x : xs) = x + sum xs

  28. where aux [] a = a aux (x : xs) a = aux xs (a + x) Objectives Accumulating Recursion Activity References Accumulating Recursion ◮ In accumulating recursion: generate an intermediate result now , and give that to the recursive call. ◮ Usually this requires an auxiliary function. Tail Recursive Summation 1 sum xx = aux xx 0 2 3

  29. | odd x = fun1 xs + 1 Objectives Accumulating Recursion Activity References Convert These Functions! ◮ Here are three functions. Try converting them to tail recursion. 1 fun1 [] = 0 2 fun1 (x : xs) | even x = fun1 xs - 1 3 4 5 fun2 1 = 0 6 fun2 n = 1 + fun2 (n `div` 2) 7 8 fun3 1 = 1 9 fun3 2 = 1 10 fun3 n = fun3 (n - 1) + fun3 (n - 2)

  30. aux n a = aux (n `div` 2) (a + 1) where aux [] a = a where aux 1 a = a | odd x = aux xs (a + 1) aux (x : xs) | even x = aux xs (a - 1) Objectives Accumulating Recursion Activity References Solution for fun1 and fun2 ◮ Usually it’s best to create a local auxiliary function. 1 fun1 xx = aux xx 0 2 3 4 5 6 fun2 n = aux n 1 7 8

  31. aux n f1 f2 = aux (n - 1) f2 (f1 + f2) where aux 0 f1 f2 = f1 Objectives Accumulating Recursion Activity References Solution for fun3 ◮ Because the recursion calls itself twice, we need two accumulators. 1 fun3 n = aux n 1 1 2 3

  32. Objectives Accumulating Recursion Activity References References [DG05] Olivier Danvy and Mayer Goldberg. “There and Back Again”. In: Fundamenta Informaticae 66.4 (Jan. 2005), pp. 397–413. ISSN: 0169-2968. URL: http://dl.acm.org/citation.cfm?id=1227189.1227194 . [Ste77] Guy Lewis Steele Jr. “Debunking the ”Expensive Procedure Call” Myth or, Procedure Call Implementations Considered Harmful or, LAMBDA: The Ultimate GOTO”. In: Proceedings of the 1977 Annual Conference . ACM ’77. Seattle, Washington: ACM, 1977, pp. 153–162. URL: http://doi.acm.org/10.1145/800179.810196 .

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 Tail Recursion Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

558 views • 29 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
CSE 490 U Natural Language Processing Spring 2016 Parsing (Trees) Yejin Choi - University of

CSE 490 U Natural Language Processing Spring 2016 Parsing (Trees) Yejin Choi - University of

CSE 490 U Natural Language Processing Spring 2016 Parsing (Trees) Yejin Choi - University of Washington [Slides from Dan Klein, Michael Collins, Luke Zettlemoyer and Ray Mooney] Topics Parse Trees (Probabilistic) Context Free Grammars

1.05k views • 81 slides
IMWG Conference Series Wednesday, June 21, 2017 International Myeloma Foundation Questions for

IMWG Conference Series Wednesday, June 21, 2017 International Myeloma Foundation Questions for

IMWG Conference Series Wednesday, June 21, 2017 International Myeloma Foundation Questions for Todays Conference Series What is ideal imaging in 2017? How will new agents impact frontline therapy? Can MRD testing in trials guide

576 views • 34 slides
Which is the best treatment for relapsed APL? 7th International Symposium on Acute Promyelocytic

Which is the best treatment for relapsed APL? 7th International Symposium on Acute Promyelocytic

Which is the best treatment for relapsed APL? 7th International Symposium on Acute Promyelocytic Leukemia, Rome, September 24 27, 2017 Eva Lengfelder Department of Hematology and Oncology University Hospital Mannheim, University of

637 views • 26 slides
FHA PFE Learning Collaborative Patient and Family Advisors: Onboarding and Expanding

FHA PFE Learning Collaborative Patient and Family Advisors: Onboarding and Expanding

FHA PFE Learning Collaborative Patient and Family Advisors: Onboarding and Expanding Opportunities for Involvement August 25, 2017 Todays Agenda Welcome and Introductions Moffitt Cancer Center: Patient and Family Advisory Program:

477 views • 43 slides
A Bibliographers Toolbox Nelson H. F . Beebe Department of Mathematics University of Utah

A Bibliographers Toolbox Nelson H. F . Beebe Department of Mathematics University of Utah

A Bibliographers Toolbox Nelson H. F . Beebe Department of Mathematics University of Utah Salt Lake City, UT 84112-0090 USA Practical T EX 2004 talk. . . p.1/30 A bibliographers credo B IB T EX Bibliographic databases deserve

579 views • 30 slides
The Magic of ELFs Mark Zhandry Princeton University (Work done

The Magic of ELFs Mark Zhandry Princeton University (Work done

The Magic of ELFs Mark Zhandry Princeton University (Work done while at MIT) Prove this secure: Enc(m) = ( TDP(r), H(r) m ) (CPA security, many-bit messages, arbitrary

1.1k views • 64 slides
BUILDING OPPORTUNITIES John Randolph, Paul Ely, Sco2 Kerklo, Erin

BUILDING OPPORTUNITIES John Randolph, Paul Ely, Sco2 Kerklo, Erin

BUILDING OPPORTUNITIES John Randolph, Paul Ely, Sco2 Kerklo, Erin Hopkins, Georg Reichard, Mike Vellines, Kim Briele , Anamaria Bukvic, Julia Gohlke, Emma Lineberry,

385 views • 13 slides
Features of Statistical Parsers Mark Johnson Brown Laboratory for Linguistic Information

Features of Statistical Parsers Mark Johnson Brown Laboratory for Linguistic Information

Features of Statistical Parsers Mark Johnson Brown Laboratory for Linguistic Information Processing CoNLL 2005 1 Features of Statistical Parsers Confessions of a bottom-feeder: Dredging in the Statistical Muck Mark Johnson Brown Laboratory

879 views • 59 slides

More recommend