SettingsRecursion
Bar recursion
Bar recursion is a generalized form of recursion developed by Spector in his 1962 paper.
Bar recursion is a generalized form of recursion developed by Spector in his 1962 paper.
Corecursion
In computer science, corecursion is a type of operation that is dual to recursion.
In computer science, corecursion is a type of operation that is dual to recursion.
Course-of-values recursion
In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion.
In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion.
Droste effect
The Droste effect — known as mise en abyme in heraldry — is the effect of a picture appearing within itself, in a place where a similar picture would realistically be expected to appear.
The Droste effect — known as mise en abyme in heraldry — is the effect of a picture appearing within itself, in a place where a similar picture would realistically be expected to appear.
Fixed point combinator
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
Fixed-point combinator
In computer science, a fixed-point combinator is a higher-order function that computes a fixed point of other functions.
In computer science, a fixed-point combinator is a higher-order function that computes a fixed point of other functions.
Fold (higher-order function)
In functional programming, fold – also known variously as reduce, accumulate, compress, or inject – are a family of higher-order functions that analyze a recu...
In functional programming, fold – also known variously as reduce, accumulate, compress, or inject – are a family of higher-order functions that analyze a recu...
Infinite loop
An infinite loop (also known as an endless loop) is a sequence of instructions in a computer program which loops endlessly, either due to the loop having no terminating condition, having o...
An infinite loop (also known as an endless loop) is a sequence of instructions in a computer program which loops endlessly, either due to the loop having no terminating condition, having o...
Left recursion
In computer science, left recursion is a special case of recursion.
In computer science, left recursion is a special case of recursion.
Mutual recursion
In mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational functions are defined in terms of each other.
In mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational functions are defined in terms of each other.
Polymorphic recursion
In computer science, polymorphic recursion refers to a recursive parametrically polymorph function where the type parameter changes with each recursive invocation made instead of staying constant.
In computer science, polymorphic recursion refers to a recursive parametrically polymorph function where the type parameter changes with each recursive invocation made instead of staying constant.
Primitive recursive function
The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions (µ-recursive functions ar...
The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions (µ-recursive functions ar...
Recursion
Recursion is the process of repeating items in a self-similar way.
Recursion is the process of repeating items in a self-similar way.
Recursion (computer science)
Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem.
Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem.
Recursion termination
In computing, Recursion termination is when certain conditions are met and the recursive algorithm ceases calling itself and begins to return values.
In computing, Recursion termination is when certain conditions are met and the recursive algorithm ceases calling itself and begins to return values.
Recursive language
In mathematics, logic and computer science, a formal language is called recursive if is a recursive subset of the set of all possible finite sequences over the alphabet of the language.
In mathematics, logic and computer science, a formal language is called recursive if is a recursive subset of the set of all possible finite sequences over the alphabet of the language.
Tail call
In computer science, a tail call is a subroutine call that happens inside another procedure as its final action; it may produce a return value which is then immediately returned by the calling p...
In computer science, a tail call is a subroutine call that happens inside another procedure as its final action; it may produce a return value which is then immediately returned by the calling p...
Transfinite induction
Transfinite induction is an extension of mathematical induction to well-ordered sets, for instance to sets of ordinals or cardinals.
Transfinite induction is an extension of mathematical induction to well-ordered sets, for instance to sets of ordinals or cardinals.
Walther recursion
In computer programming, Walther recursion is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs.
In computer programming, Walther recursion is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs.