Content deleted Content added
C supports closures, the qsort function in an exemple of this. |
Added Ada language to the list |
||
(28 intermediate revisions by 19 users not shown) | |||
Line 1:
{{Short description|Programming paradigm}}
{{one source|date=June 2019}}
{{more citations needed|date=June 2019}}
'''Higher-order programming''' is a style of [[computer programming]] that uses software components, like functions, modules or objects, as values. It is usually instantiated with, or borrowed from, models of computation such as [[lambda calculus]] which make heavy use of [[higher-order function]]s. A programming language can be considered higher-order if components, such as procedures or labels, can be used just like data. For example, these elements could be used in the same way as arguments or values.<ref>{{Cite report| author = Reynolds, John C. | title = Proceedings of the ACM annual conference on - ACM '72 | chapter = Definitional Interpreters for Higher-Order Programming Languages | year = 1972 | volume = 2 | pages = 717–740 | isbn = 9781450374927 | publisher = Association for Computing Machinery | chapter-url = https://www.classes.cs.uchicago.edu/archive/2007/fall/22100-1/papers/definterp.pdf | doi = 10.1145/800194.805852 | access-date = December 19, 2021 }}</ref>
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
==See also==
*[[Prolog#Higher-order programming]]
*[[Higher-order logic programming]]
==References==
{{reflist}}
==External links==
* [http://w3future.com/html/stories/hop.xml "Higher Order Programming"] by Sjoerd Visscher (Uses JavaScript as example language)
{{compu-prog-stub}}▼
[[Category:Programming paradigms]]
▲{{compu-prog-stub}}
|