Higher-order programming

This is an old revision of this page, as edited by Marudubshinki (talk | contribs) at 01:40, 19 July 2006 («"Examples" → "Prominent examples", "Haskell_programming_language" → "Haskell programming language"» those arent the only exazmples). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 functions.

For example, in High Order Programming, one can pass 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. Prominent examples of languages supporting this are the Ruby programming language, all the Lisp programming languages (such as the Scheme programming language), and Haskell.

  • [1] (Original article is licensed by CC "by" -- but has an unknown original author.)