Thus far in our presentation of recursive, functional programming, we have primarily used recursive control behavior, where the definition of a recursive function naturally reflects the recursive specification of the function. For instance, consider the following definition of a factorial function in Scheme, which naturally mirrors the mathematical definition of a factorial
Each call to factorial is made with a promise to multiply the value returned by n at the time of the call. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
