plural of tail recursion

(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".

(computing) Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input.

(semantics) A definition of a term within which the term itself appears, and that is well-founded, avoiding an infinite regress.

(grammar) Relating to left recursion

plural of recursive function

(computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar.

An acronym in which a word (often the first) of the phrase represented by the acronym is the acronym itself.

(computing) Any function that uses recursion and can call itself until a certain condition is met

(programming) Employing tail recursion.