Find link

language:

Find link is a tool written by Edward Betts.

searching for Map (higher-order function) 20 found (39 total)

alternate case: map (higher-order function)

Functional (mathematics) (1,446 words) [view diff] no match in snippet view article

[citation needed] In computer science, it is synonymous with a higher-order function, which is a function that takes one or more functions as arguments

Anonymous recursion (1,513 words) [view diff] no match in snippet view article find links to article

function by name. This can be done either explicitly, by using a higher-order function – passing in a function as an argument and calling it – or implicitly

Flix (programming language) (3,274 words) [view diff] no match in snippet view article

system supports effect polymorphism which means that the effect of a higher-order function may depend on the effect(s) of its argument(s). Flix supports Datalog

Differential operator (3,693 words) [view diff] no match in snippet view article find links to article

accepts a function and returns another function (in the style of a higher-order function in computer science). This article considers mainly linear differential

Snap! (programming language) (1,230 words) [view diff] no match in snippet view article

having one or more empty slot(s)/argument(s) that are filled by a "higher order function" (the one that is calling the anonymous one). (Their computer-science

Non-local variable (412 words) [view diff] no match in snippet view article find links to article

registers. If the nested function is passed as an argument to a higher-order function a closure needs to be built in order to locate the non-local variables

Catamorphism (1,835 words) [view diff] no match in snippet view article find links to article

10*(100*(1000*3))=3.000.000. The cata map is closely related to the right fold (see Fold (higher-order function)) of lists foldrList. The morphism lift

Function (mathematics) (11,317 words) [view diff] no match in snippet view article

functions List of functions Function fitting Implicit function Higher-order function Homomorphism Morphism Microfunction Distribution Functor Associative

F Sharp (programming language) (4,050 words) [view diff] no match in snippet view article

printList lst = for x in lst do printfn $"{x}" /// Iteration using a higher-order function let printList2 lst = List.iter (printfn "%d") lst /// Iteration

Shader (2,435 words) [view diff] no match in snippet view article find links to article

computation throughput. A programming model with shaders is similar to a higher order function for rendering, taking the shaders as arguments, and providing a

Recursion (3,678 words) [view diff] no match in snippet view article find links to article

convincing dream about awakening from sleep Fixed point combinator – Higher-order function Y for which Y f = f (Y f)Pages displaying short descriptions of

Function composition (3,658 words) [view diff] no match in snippet view article find links to article

Functional decomposition Functional square root Functional equation Higher-order function Infinite compositions of analytic functions Iterated function Lambda

Church encoding (6,538 words) [view diff] no match in snippet view article find links to article

numbers under Church encoding. The higher-order function that represents natural number n is a function that maps any function f {\displaystyle f} to

Iterator (5,763 words) [view diff] no match in snippet view article find links to article

constructs an iterator print(number) An internal iterator is a higher order function (often taking anonymous functions) that traverses a collection while

Lisp (programming language) (9,697 words) [view diff] no match in snippet view article

with a higher-order function. (The same is true of many functional programming languages.) A good example is a function which in Scheme is called map and

Newton Howard (1,438 words) [view diff] no match in snippet view article find links to article

neurophysiological processes to higher order function. In 2013, he proposed the Brain Code (BC) theory, a methodology for using the FCU to map entire circuits of neurological

Smalltalk (9,521 words) [view diff] no match in snippet view article find links to article

example, the message select: on a Collection is equivalent to the higher-order function filter on an appropriate functor. Control structures do not have

List of abstractions (computer science) (546 words) [view diff] no match in snippet view article

Often used in place of iterative loops to solve complex problems. Higher-order function A function that takes one or more functions as arguments, returns

Lambda calculus (11,551 words) [view diff] no match in snippet view article find links to article

f x 2 := λfx.f (f x) 3 := λfx.f (f (f x)) A Church numeral is a higher-order function—it takes a single-argument function f, and returns another single-argument

XACML (5,190 words) [view diff] no match in snippet view article find links to article

a Boolean function and 2 or more attribute values or bags. The higher-order function applies the Boolean function to the remaining parameters. Example: