search results

  1. This program is not written in a tail recursion style. Now take this Scheme program as an example:;; ... In this form the function is not tail- recursive, ...
    en.wikipedia.org/wiki/Tail_recursion - Cached
    More re sults from en.wikipedia.org »
  2. Microsoft Powerpoint
    ... avoiding the inefficiencies A tail recursive function is one where every ... with Recursion Tail recursion is iteration Scheme’s top level loop ...
    www.csee.umbc.edu/.../0101/notes/scheme/​tailRecursion.ppt
  3. Recursion is the basic iteration mechanism in Scheme. ... gcc 2.95.3 on an i386 does tail-recursion elimination on the tail-recursive factorial1 function when \"-O\" is ...
    www.c2.com/cgi/wiki?TailRecursion - Cached
  4. \"Proper\" Tail Recursion as found in Scheme is a feature that some miss in CL. It means carefully written recursive function calls can execute in constant space.
    www.cliki.net/Tail%20Recursion - Cached
  5. Consider the following recursive functions ... An implementation of Scheme is required to perform tail ... (in which case the recursion is called tail recursion ...
    www.math.grin.edu/.../2004S/Readings/​tail-recursion.html - Cached
  6. For a function to be tail recursive, there must be nothing to do after the function returns except return its value. That is, the last thing that happens in the ...
    stackoverflow.com/.../tail-recursive-​functions-in-scheme - Cached
  7. For a tail call, Scheme doesn\'t have to remember anything, ... To transform a tail-recursive function into a while loop, follow the following steps.
    www.owlnet.rice.edu/~comp210/96spring/​Labs/lab09.html - Cached
  8. As a rule, Scheme tail-recursive functions use constant stack space. share | improve this answer. edited Apr 22 at 22:32. Cristian Ciupitu 3,704 1 16 29. answered Aug ...
    stackoverflow.com/questions/33923 - Cached
  9. Scheme tries to encourage the recursive style, which is the functional solution. There\'s only one problem: ... The advantage of tail-recursive functions
    community.schemewiki.org/?iterative-​processes - Cached
  10. So the function is tail-recursive, ... The language specification of Scheme requires that tail-recursive operations are to be optimized so as not to grow the stack.
    english.turkcebilgi.com/Tail+recursion - Cached