[ < ] | [ > ] |  | [ << ] | [ Up ] | [ >> ] |  |  |  |  | [Top] | [Contents] | [Index] | [ ? ]

### 2.7.9 Recursion

Defining functions or programs self referentially is sometimes informally known as recursion. In functional languages, the clever use of “combinators” is often preferred to this practice, and is in fact well supported by the virtual machine. However, some computations may be inexpressible without an explicitly “recursive” formulation, so there is some support for that as well.

This document was generated on November 8, 2012 using texi2html 1.82.