Higher-order programming: Difference between revisions

Revision as of 14:35, 9 February 2011

Revision as of 03:26, 24 February 2011

Line 1:

'''Higher-order programming''' is a style of [[computer programming]] that exploits the theoretical ability to useuses functions as values. It is usually instantiated with, or borrowed from, models of computation like the [[lambda calculus]] which make heavy use of [[higher-order function]]s.

For example, in higher-order programming, one can pass [[function (programming)|functions]] as arguments to other functions and functions can be the return value of other functions (such as in [[macro (computer science)|macros]] or for [[interpreter (computing)|interpreting]]). This style of programming is mostly used in [[functional programming]], but it can also be very useful in 'regular' [[object-oriented programming]].