Andere Kunden interessierten sich auch für
![N Fold Hemiring]( "N Fold Hemiring")
N Fold Hemiring39,99 €![n-fold RING]( "n-fold RING")
n-fold RING44,99 €![Elements of N fold Ring]( "Elements of N fold Ring")
Elements of N fold Ring39,99 €![Higher Dimension]( "Higher Dimension")
Higher Dimension22,99 €![Pseudospectral Chebyshev Approximation for Solving Higher-Order BVPs]( "Pseudospectral Chebyshev Approximation for Solving Higher-Order BVPs")
Pseudospectral Chebyshev Approximation for Solving Higher-Order BVPs32,99 €![Analytic semigroup approach to higher order parabolic problems]( "Analytic semigroup approach to higher order parabolic problems")
Analytic semigroup approach to higher order parabolic problems20,99 €![Higher Order Necessary Conditions in Optimal Control Theory]( "Higher Order Necessary Conditions in Optimal Control Theory")
Higher Order Necessary Conditions in Optimal Control Theory40,99 €
In functional programming, fold, also known variously as reduce, accumulate, compress or inject, is a family of higher-order functions that process a data structure in some order and build up a return value. Typically, a fold deals with two things: a combining function and a data structure, typically a list of elements. The fold then proceeds to combine elements of the data structure using the function in some systematic way.Folds are in a sense dual to unfolds, which take a starting value of some other type and apply a function recursively to decide how to construct a data structure, whereas a fold recursively breaks that structure down, replacing it with other functions and values.