Higher order programming
From Wikipedia, the free encyclopedia
Higher-order programming is a style of programming that exploits the theoretical ability to use 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 functions.
For example, in higher-order programming, one can pass functions as arguments to other functions and functions can be the return value of other functions (such as in macros or for interpretation). 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 Python, Ruby, all the Lisp programming languages (such as Scheme), and Haskell.
[edit] External link
- "Higher Order Programming" -(Uses JavaScript; the original article is licensed by CC "by", but has an unknown original author)
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |
