Higher-Order Perl

Chapter 5: From Recursion to Iterators

Table of Contents

  1. The Partition Problem Revisited
    1. Finding All Possible Partitions
    2. Optimizations
    3. Variations
  2. How to Convert a Recursive Function to an Iterator
  3. A Generic Search Iterator
  4. Other general techniques for eliminating recursion
    1. Tail Call Elimination
      • Someone Else's Problem
    2. Creating Tail Calls
    3. Explicit Stacks
      • Eliminating Recursion from fib

13146 words / 41 pages. (Last update Sun Nov 7 23:38:54 2004)

Chapter 4 | Chapter 6 | TOP

Order Higher-Order Perl online from Barnes & Noble

Subscribe to low-volume announcements-only mailing list:

Your email address:


Return to: Universe of Discourse main page | What's new page | Perl Paraphernalia | Higher-Order Perl

mjd-perl-hop+@plover.com