Recursive function
noun
1.
(logic, maths) a function defined in terms of the repeated application of a number of simpler functions to their own values, by specifying a base clause and a recursion formula
Read Also:
- Recursively
adjective 1. pertaining to or using a rule or procedure that can be applied repeatedly. 2. Mathematics, Computers. pertaining to or using the mathematical process of recursion: a recursive function; a recursive procedure. adjective, adverb
- Recursive macro actuated generator
tool (RMAG) Robert A. Magnuson, NIH ca 1970. A stand-alone macroprocessor for IBM 360/370 under VS or OS. Many built-in features and a library of several hundred macros. Several large systems were written in RMAG to generate source code for languages such as IBM JCL, IBM assembly language, COBOL. There was also a system (SLANG: […]
- Recursiveness
adjective 1. pertaining to or using a rule or procedure that can be applied repeatedly. 2. Mathematics, Computers. pertaining to or using the mathematical process of recursion: a recursive function; a recursive procedure.
- Recursive subroutine
noun 1. (computing) a subroutine that can call itself as part of its execution
- Recursive type
A data type which contains itself. The commonest example is the list type, in Haskell: data List a = Nil | Cons a (List a) which says a list of a’s is either an empty list or a cons cell containing an ‘a’ (the “head” of the list) and another list (the “tail”). Recursion is […]