Higher-order programming: Difference between revisions

Revision as of 00:46, 1 February 2006

Revision as of 01:40, 19 July 2006

Line 1:

'''Higher Order Programming''' is programming that exploits the ability to use functions as values; it is usually borrowed from models of computation like the [[lambda calculus]] which make heavy use of [[Higher-order function]]s.

For example, in High Order Programming, one can pass [[Function (programming)|functions]] as arguments to other functions and functions can be the return value of other functions. This style of programming is mostly used in [[functional programming]], but it can also be very useful in 'regular' [[object oriented programming]]. ExamplesProminent examples of languages supporting this are the [[Ruby programming language]], all the [[Lisp programming language]]s (such as the [[Scheme programming language]]), and [[Haskell_programming_languageHaskell programming language|Haskell]].

==External links==