Applicative programming language: Difference between revisions
Content deleted Content added
Change "no citations" template to "needs additional citations" |
m Add references section |
||
| Line 7: | Line 7: | ||
* [[Applicative universal grammar]] |
* [[Applicative universal grammar]] |
||
* [[Function-level programming]] |
* [[Function-level programming]] |
||
==References== |
|||
{{Reflist}} |
|||
==External links== |
==External links== |
||
Revision as of 17:28, 28 April 2020
 | This article needs additional citations for verification. (April 2020) |
In the classification of programming languages, an applicative programming language is built out of functions applied to arguments. Applicative languages are functional, and applicative is often used as a synonym for functional.[1] However, concatenative languages can be functional, while not being applicative.[2]
Lisp and ML are applicative programming languages. In Haskell, this programming paradigm is developed into the applicative functor, which extends the higher-order functional abstraction beyond monad.
See also
References
- ^ Dershowitz, Nachum; Plaisted, David A. (1985). "Logic Programming cum Applicative Programming". Symposium on Logic Programming. Boston, MA. pp. 54–66.
- ^ Jon Purdy (12 February 2012). "Why Concatenative Programming Matters". Retrieved 28 April 2020.
External links
- Applicative Programming with Effects (in Haskell, 2008) by Conor McBride and Ross Paterson