VDict - Definition of recursion

Computing (FOLDOC) dictionary (also found in English - English (Wordnet), )

recursion

mathematics, programming When a function (or procedure)

calls itself. Such a function is called "recursive". If the

call is via one or more other functions then this group of

functions are called "mutually recursive".

If a function will always call itself, however it is called,

then it will never terminate. Usually however, it first

performs some test on its arguments to check for a "base case"

- a condition under which it can return a value without

calling itself.

The canonical example of a recursive function is

factorial 0 = 1

factorial n = n * factorial (n-1)

using it where a procedural language would use iteration.

(1996-05-11)

Related search result for "recursion"

Words contain "recursion":
General Recursion Theorem mutual recursion recursion recursion theory structural recursion tail recursion tail recursion modulo cons tail recursion optimisation
Words contain "recursion" in its definition in Computing (FOLDOC) dictionary:
tail recursion optimisation tail recursion recursion mutual recursion conversion to iteration tail recursion modulo cons recurse mutually recursive TRO recursive more...