Tail-call optimization
Tail recursion has special status in Racket because the compiler notices tail calls and optimizes them. Ordinarily, each call to a function, including a recursive call, causes another set of arguments to be saved in a block of memory called the call stack.
Is tail a recursion?
What is tail recursion? A recursive function is tail recursive when a recursive call is the last thing executed by the function. For example the following C++ function print() is tail recursive.
Is OCaml tail recursive?
OCaml Tail recursion
Functional languages such as OCaml rely heavily on recursive functions. However, such functions can lead to memory over consumption or, when handling large datasets, to stack overflows. Tail recursion is an important source of optimization in such cases.
