Applicative programming language: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 17:23, 28 April 2020 edit Quuxbazbarfoo (talk \| contribs) Extended confirmed users 851 edits Rewrite first paragraph, clarifying the definition and relation to functional/concatenative programming, and adding citations. Tag: citing a blog or free web host ← Previous edit		Latest revision as of 19:41, 11 July 2025 edit undo Citation bot (talk \| contribs) Bots 5,868,155 edits Removed parameters. \| Use this bot. Report bugs. \| #UCB_CommandLine
(8 intermediate revisions by 3 users not shown)
Line 1: {{~~unreferenced~~More citations needed\|date=~~December~~April ~~2011~~2020}} {{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last1=McBride\|first1=Conor\|last2=Paterson\|first2=Ross\|date=2008-01-01\|title=Applicative programming with effects\|journal=Journal of Functional Programming\|volume=18\|issue=1\|pages=1–13\|doi=10.1017/S0956796807006326\|issn=1469-7653\|citeseerx=10.1.1.114.1555}}</ref>}} In the [[programming paradigm\|classification of programming languages]], an '''applicative programming language''' is built out of [[Function (computer science)\|functions]] applied to [[Argument (computer science)\|arguments]]. Applicative languages are [[Functional programming\|functional]], and applicative is often used as a synonym for functional.<ref>{{cite conference\|title=Logic Programming cum Applicative Programming\|first1=Nachum\|last1=Dershowitz\|first2=David A.\|last2=Plaisted\|year=1985\|book-title=Symposium on Logic Programming\|place=Boston, MA\|pages=~~54-66~~54–66\|~~url=https://~~citeseerx~~.ist.psu.edu/viewdoc/download?doi~~=10.1.1.404.3826~~&rep=rep1&type=pdf~~}}</ref> However, [[concatenative languages]] can be functional, while not being applicative.<ref>{{cite web\|url=https://evincarofautumn.blogspot.com/2012/02/why-concatenative-programming-matters.html\|title=Why Concatenative Programming Matters\|author=Jon Purdy\|date=12 February 2012\|access-date=28 April 2020}}</ref> The [[Semantics (computer science)\|semantics]] of applicative languages are based on [[beta reduction]] of terms, and [[Side effect (computer science)\|Side effect]] such as mutation of [[State (computer science)\|state]] are not permitted.<ref name="Backus 1977">{{Cite journal \| doi = 10.1145/359576.359579\| title = Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs\| journal = Communications of the ACM\| volume = 21\| issue = 8\| pages = 613–641\| year = 1978\| last1 = Backus \| first1 = J. \| doi-access = free}}</ref> [[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages. In [[Haskell (programming language)\|Haskell]], this programming paradigm is developed into the applicative [[functor]], which extends the [[higher-order function]]al abstraction beyond [[Monad (functional programming)\|monad]]. [[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages. ==See also== Line 8 ⟶ 12: * [[Function-level programming]] ==~~External links~~References== {{Reflist}} * [http://www.soi.city.ac.uk/~ross/papers/Applicative.html Applicative Programming with Effects] (in Haskell, 2008) by [[Conor McBride]] and Ross Paterson [[Category:Programming language classification]]