Applicative programming language - Revision history

Slappi at 14:36, 2 December 2024

2024-12-02T14:36:05Z

← Previous revision		Revision as of 14:36, 2 December 2024
Line 4:		Line 4:
	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\|citeseerx=10.1.1.404.3826}}</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>		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\|citeseerx=10.1.1.404.3826}}</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~~ ~~effects~~]] 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>		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.		[[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages.

Citation bot: Add: doi-broken-date, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Applicative computing systems | #UCB_Category 3/5

2024-11-20T11:54:30Z

Add: doi-broken-date, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Applicative computing systems | #UCB_Category 3/5

← Previous revision		Revision as of 11:54, 20 November 2024
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
	{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|~~last~~=McBride\|~~first~~=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>}}		{{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\|doi-broken-date=2024-11-20 \|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\|citeseerx=10.1.1.404.3826}}</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>		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\|citeseerx=10.1.1.404.3826}}</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>

Citation bot: Alter: pages. Add: citeseerx. Removed URL that duplicated unique identifier. Formatted dashes. | You can use this bot yourself. Report bugs here. | Activated by Headbomb | via #UCB_webform

2020-05-01T18:11:21Z

Alter: pages. Add: citeseerx. Removed URL that duplicated unique identifier. Formatted dashes. | You can use this bot yourself. Report bugs here. | Activated by Headbomb | via #UCB_webform

← Previous revision		Revision as of 18:11, 1 May 2020
Line 2:		Line 2:
	{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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>}}		{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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~~\|~~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>		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\|citeseerx=10.1.1.404.3826}}</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 effects]] 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~~\| year = 1978\| last1 = Backus \| first1 = J. \| doi-access = free}}</ref>		The [[Semantics (computer science)\|semantics]] of applicative languages are based on [[beta reduction]] of terms, and [[side effects]] 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.		[[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages.

Quuxbazbarfoo: Remove external link to "Applicative programming with effects"

2020-04-28T18:11:16Z

Remove external link to "Applicative programming with effects"

← Previous revision		Revision as of 18:11, 28 April 2020
Line 14:		Line 14:
	==References==		==References==
	{{Reflist}}		{{Reflist}}

	==External links==
	* [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]]		[[Category:Programming language classification]]

Quuxbazbarfoo: Remove reference to applicative functors and add distinguishing note

2020-04-28T18:10:48Z

Remove reference to applicative functors and add distinguishing note

← Previous revision		Revision as of 18:10, 28 April 2020
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
			{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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\|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>		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\|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 effects]] 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\| year = 1978\| last1 = Backus \| first1 = J. \| doi-access = free}}</ref>		The [[Semantics (computer science)\|semantics]] of applicative languages are based on [[beta reduction]] of terms, and [[side effects]] 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\| 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==		==See also==

Quuxbazbarfoo: Add line about semantics, from Backus' "Can Programming Be Liberated from the von Neumann Style?"

2020-04-28T17:55:35Z

Add line about semantics, from Backus' "Can Programming Be Liberated from the von Neumann Style?"

← Previous revision		Revision as of 17:55, 28 April 2020
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
	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\|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>		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\|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 effects]] 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\| 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. 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]].

Quuxbazbarfoo: Add references section

2020-04-28T17:28:51Z

Add references section

← Previous revision		Revision as of 17:28, 28 April 2020
Line 7:		Line 7:
	* [[Applicative universal grammar]]		* [[Applicative universal grammar]]
	* [[Function-level programming]]		* [[Function-level programming]]

			==References==
			{{Reflist}}

	==External links==		==External links==

Quuxbazbarfoo: Change "no citations" template to "needs additional citations"

2020-04-28T17:27:35Z

Change "no citations" template to "needs additional citations"

← Previous revision		Revision as of 17:27, 28 April 2020
Line 1:		Line 1:
	{{~~unreferenced~~\|date=~~December~~ ~~2011~~}}		{{More citations needed\|date=April 2020}}
	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\|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>		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\|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>

Quuxbazbarfoo: Rewrite first paragraph, clarifying the definition and relation to functional/concatenative programming, and adding citations.

2020-04-28T17:23:33Z

Rewrite first paragraph, clarifying the definition and relation to functional/concatenative programming, and adding citations.

← Previous revision		Revision as of 17:23, 28 April 2020
Line 1:		Line 1:
	{{unreferenced\|date=December 2011}}		{{unreferenced\|date=December 2011}}
			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\|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>
	In the [[programming paradigm\|classification of programming languages]], an '''applicative programming language''' is designed to support the development of programs as giving the result of a function of the combined variables. Successive functional transformations are applied to data to arrive at the result. Such a [[programming language\|language]], with program control and total state kept in the background, may also be known as a [[functional language]], in a rather loose sense of the term.

	[[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. 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]].

82.113.98.222 at 20:20, 18 March 2020

2020-03-18T20:20:28Z

← Previous revision		Revision as of 20:20, 18 March 2020
Line 2:		Line 2:
	In the [[programming paradigm\|classification of programming languages]], an '''applicative programming language''' is designed to support the development of programs as giving the result of a function of the combined variables. Successive functional transformations are applied to data to arrive at the result. Such a [[programming language\|language]], with program control and total state kept in the background, may also be known as a [[functional language]], in a rather loose sense of the term.		In the [[programming paradigm\|classification of programming languages]], an '''applicative programming language''' is designed to support the development of programs as giving the result of a function of the combined variables. Successive functional transformations are applied to data to arrive at the result. Such a [[programming language\|language]], with program control and total state kept in the background, may also be known as a [[functional language]], in a rather loose sense of the term.

	[[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are ~~application~~ 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. 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]].

	==See also==		==See also==

← Previous revision		Revision as of 14:36, 2 December 2024
Line 4:		Line 4:
	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\|citeseerx=10.1.1.404.3826}}</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>		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\|citeseerx=10.1.1.404.3826}}</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~~ ~~effects~~]] 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>		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.		[[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages.

← Previous revision		Revision as of 11:54, 20 November 2024
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
	{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|~~last~~=McBride\|~~first~~=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>}}		{{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\|doi-broken-date=2024-11-20 \|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\|citeseerx=10.1.1.404.3826}}</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>		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\|citeseerx=10.1.1.404.3826}}</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>

← Previous revision		Revision as of 18:11, 1 May 2020
Line 2:		Line 2:
	{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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>}}		{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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~~\|~~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>		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\|citeseerx=10.1.1.404.3826}}</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 effects]] 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~~\| year = 1978\| last1 = Backus \| first1 = J. \| doi-access = free}}</ref>		The [[Semantics (computer science)\|semantics]] of applicative languages are based on [[beta reduction]] of terms, and [[side effects]] 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.		[[Lisp programming language\|Lisp]] and [[ML programming language\|ML]] are applicative programming languages.

← Previous revision		Revision as of 18:10, 28 April 2020
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
			{{Distinguish\|text=[[applicative functor\|applicative functors]], introduced in the paper "Applicative programming with effects"<ref>{{Cite journal\|last=McBride\|first=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\|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>		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\|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 effects]] 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\| year = 1978\| last1 = Backus \| first1 = J. \| doi-access = free}}</ref>		The [[Semantics (computer science)\|semantics]] of applicative languages are based on [[beta reduction]] of terms, and [[side effects]] 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\| 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==		==See also==

← Previous revision		Revision as of 17:55, 28 April 2020
Line 1:		Line 1:
	{{More citations needed\|date=April 2020}}		{{More citations needed\|date=April 2020}}
	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\|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>		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\|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 effects]] 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\| 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. 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]].