You may create the page "Higherorder function", but consider checking the search results below to see whether it is already covered.
For search help, please visit Help:Searching.

• Higher-order function
  In mathematics and computer science , higher-order functions, functional forms, or functionals are function s which do at least one of the ...
  7 KB (1,021 words) - 12:53, 17 February 2010
• Fold (higher-order function)
  In functional programming , fold, also known variously as reduce, accumulate, compress or inject, is a family of higher-order function s ...
  15 KB (2,090 words) - 14:42, 5 March 2010
• Map (higher-order function)
  In many programming language s, map is the name of a higher-order function that applies a given function element-wise to a list of ...
  10 KB (1,267 words) - 09:43, 5 February 2010
• Filter (higher-order function)
  In functional programming , filter is a higher-order function that processes a data structure (typically a list ) in some order to produce ...
  6 KB (706 words) - 03:22, 8 January 2010
• Anamorphism (redirect from Unfold (higher-order function))
  In functional programming , an anamorphism is a kind of generic function which can (co)recursively construct a result of a certain type ...
  6 KB (757 words) - 12:03, 8 March 2010
• Convolution (computer science) (redirect from Zip (higher-order function))
  In computer science , specifically formal language s, convolution is a function which maps a tuple of sequence s into a sequence of tuple ...
  2 KB (227 words) - 22:44, 13 September 2009
• Monad (functional programming) (redirect from Bind (higher-order function))
  (bind and return) and a type constructor M that must fulfill several properties to allow the correct composition of monadic functions (i.e. ...
  42 KB (6,110 words) - 22:57, 16 March 2010
• Functional programming (section Higher-order functions)
  computation as the evaluation of mathematical function s and avoids state and mutable data. ... Higher-order functions are closely related ...
  43 KB (5,402 words) - 02:58, 8 March 2010
• Defunctionalization
  In programming languages , defunctionalization refers to a compile-time transformation which eliminates higher-order function s, replacing ...
  4 KB (621 words) - 20:59, 12 January 2010
• Higher order programming (redirect from Higher-order programming)
  Higher-order programming is a style of programming that exploits the theoretical ability to use functions as values; it is usually ...
  1 KB (147 words) - 21:24, 26 November 2009
• Unfold
  Unfold (higher-order function), in computer science a family of anamorphism functions. Unfoldment , in spirituality and physics ...
  1 KB (126 words) - 06:26, 12 April 2008
• First-class function
  language is said to support first-class functions (also called function literals, ... the use of higher-order function s is a standard practice. ...
  12 KB (1,491 words) - 19:26, 16 March 2010
• Fixed point combinator
  A fixed point combinator (or fixed-point operator) is a higher-order function that computes a fixed point of other functions. ...
  18 KB (2,762 words) - 23:44, 1 March 2010
• Operator (section Operators versus functions)
  In mathematics , an operator is a type of function . (See also Higher-order function ); or it may be a generalization of such a function, ...
  16 KB (2,069 words) - 19:45, 9 March 2010
• Higher-order logic
  NOTOC_In mathematics and logic , a higher-order logic is distinguished from first- ... A similar remark holds for higher-order functions . ...
  4 KB (449 words) - 13:43, 30 January 2010
• Differential operator
  In mathematics , a differential operator is an operator defined as a function of ... the style of a higher-order function in computer science ). ...
  10 KB (1,376 words) - 12:44, 17 February 2010
• Parser combinator
  In functional programming, the term ‘combinator’ is often used to denote functions ... higher-order functions ‘combine’ different parsers together). ...
  10 KB (1,364 words) - 21:39, 27 February 2010
• Standard ML (section Higher-Order Functions)
  Higher-Order Functions : Functions can consume functions as arguments: fun applyToBoth f x y (f x, f y) Functions can produce functions as ...
  31 KB (4,178 words) - 10:47, 2 March 2010
• Church encoding (section Higher-order function)
  pairs, lists, and tagged unions) are mapped to higher-order function s under Church encoding; the Church-Turing thesis asserts that any ...
  11 KB (1,386 words) - 12:01, 24 January 2010
• Anonymous function (section Higher-order functions)
  In computing , an anonymous function is a function (or a subroutine ) defined, and ... Higher-order functions Map: Map (higher-order function) ...
  24 KB (3,181 words) - 18:18, 29 January 2010