Talk:Concatenative programming language - Revision history

Cewbot: Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computer Science}}, {{WikiProject Computing}}.

2024-01-30T22:25:23Z

Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computer Science}}, {{WikiProject Computing}}.

← Previous revision		Revision as of 22:25, 30 January 2024
Line 1:		Line 1:
	{{WikiProject ~~Computer~~ ~~Science~~\|class=~~start~~\|~~importance=high}}~~		{{WikiProject banner shell\|class=Start\|
	{{WikiProject ~~Computing\|class=start~~\|importance=~~mid~~}}		{{WikiProject Computer science\|importance=high}}
			{{WikiProject Computing\|importance=mid}}
			}}

	This doesn't appear to be a term with significant usage outside of wikipedia, and also is very poorly defined here. Should this be deleted?		This doesn't appear to be a term with significant usage outside of wikipedia, and also is very poorly defined here. Should this be deleted?

80.133.62.138: /* Function-level programming */ Correct reference links for Enchilada and XY

2020-06-26T23:01:15Z

Function-level programming: Correct reference links for Enchilada and XY

← Previous revision		Revision as of 23:01, 26 June 2020
Line 35:		Line 35:
	: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])		: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-9\|Enchilada]],[[concatenative programming language#cite note-8\|XY]])

	: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])		: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-9\|Enchilada]],[[concatenative programming language#cite note-8\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

Diego Moya: Assessment

2013-09-13T11:45:09Z

Assessment

← Previous revision		Revision as of 11:45, 13 September 2013
Line 1:		Line 1:
	{{WikiProject ~~Computing~~}}		{{WikiProject Computer Science\|class=start\|importance=high}}
			{{WikiProject Computing\|class=start\|importance=mid}}

	This doesn't appear to be a term with significant usage outside of wikipedia, and also is very poorly defined here. Should this be deleted?		This doesn't appear to be a term with significant usage outside of wikipedia, and also is very poorly defined here. Should this be deleted?

189.58.115.194: /* Function-level programming */

2012-10-07T16:50:28Z

Function-level programming

← Previous revision		Revision as of 16:50, 7 October 2012
Line 31:		Line 31:

	: AFAIK:		: AFAIK:

⚫	: [[tacit programming\|point-free]] [[intersection (set theory)\|∩]] [[functional programming\|functional]]=[[function-level programming\|function-level]]

	: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])		: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])
Line 41:		Line 39:

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

⚫	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[~~concatenative~~ programming language\|~~concatenative~~]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

		⚫	: [[tacit programming\|point-free]] [[intersection (set theory)\|∩]] [[functional programming\|functional]]=[[function-level programming\|function-level]]

		⚫	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[stack-oriented programming language\|stack-oriented]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

	: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)		: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)

189.58.115.194: /* Function-level programming */

2012-10-07T16:40:36Z

Function-level programming

← Previous revision		Revision as of 16:40, 7 October 2012
Line 30:		Line 30:
	How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)		How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)

	: AFAIK ~~there is some relationships~~:		: AFAIK:

			: [[tacit programming\|point-free]] [[intersection (set theory)\|∩]] [[functional programming\|functional]]=[[function-level programming\|function-level]]

	: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])		: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])
Line 38:		Line 40:
	: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])		: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])
Line 44:		Line 46:
	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

	: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages~~, it is a [[subset]]~~. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)		: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)

189.26.152.54: /* Function-level programming */

2012-10-07T14:17:17Z

Function-level programming

← Previous revision		Revision as of 14:17, 7 October 2012
Line 29:		Line 29:

	How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)		How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)

			: AFAIK there is some relationships:

			: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])

			: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]])

			: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

			: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

			: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

			: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

			: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages, it is a [[subset]]. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)

Ruud Koot: /* Function-level programming */ new section

2012-02-19T15:08:45Z

Function-level programming: new section

← Previous revision		Revision as of 15:08, 19 February 2012
Line 25:		Line 25:

	: I've attempted to clarify things somewhat by explaining concatenative languages as the subset of point-free languages in which concatenation of expressions (which should be clearer than "terms") denotes function composition. If you do not think this improves things sufficiently, please reinstate the technical notice. [[User:John Nowak\|John Nowak]] ([[User talk:John Nowak\|talk]]) 03:10, 28 October 2011 (UTC)		: I've attempted to clarify things somewhat by explaining concatenative languages as the subset of point-free languages in which concatenation of expressions (which should be clearer than "terms") denotes function composition. If you do not think this improves things sufficiently, please reinstate the technical notice. [[User:John Nowak\|John Nowak]] ([[User talk:John Nowak\|talk]]) 03:10, 28 October 2011 (UTC)

			== Function-level programming ==

			How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)

John Nowak at 03:11, 28 October 2011

2011-10-28T03:11:31Z

← Previous revision		Revision as of 03:11, 28 October 2011
Line 24:		Line 24:
	I'm university level CompSci engineer, but don't understand this article because the terms are not back-referenced. For example "terms" is meaningless without either back-referencing the term "term" to one other programming or mathematical paradigm, such as logic programming or imperative. The article just seems to mumble its mind without any listeners. I think it is not understandable to anyone except anyone that already knows all about the topic. The terms must be better founded into a context. [[User:Rursus\|Rursus]] dixit. ([[User talk:Rursus\|<span style="color: red; background: #FFFF80"><sup>m</sup><u>bork<sup>3</sup></u></span>]]!) 15:50, 7 July 2011 (UTC)		I'm university level CompSci engineer, but don't understand this article because the terms are not back-referenced. For example "terms" is meaningless without either back-referencing the term "term" to one other programming or mathematical paradigm, such as logic programming or imperative. The article just seems to mumble its mind without any listeners. I think it is not understandable to anyone except anyone that already knows all about the topic. The terms must be better founded into a context. [[User:Rursus\|Rursus]] dixit. ([[User talk:Rursus\|<span style="color: red; background: #FFFF80"><sup>m</sup><u>bork<sup>3</sup></u></span>]]!) 15:50, 7 July 2011 (UTC)

	: I've attempted to clarify things somewhat by explaining concatenative languages as the subset of point-free languages in which concatenation of expressions (which should be clearer than "terms") denotes function composition. If you do not think this improves things sufficiently, please ~~re-instate~~ the technical notice. [[User:John Nowak\|John Nowak]] ([[User talk:John Nowak\|talk]]) 03:10, 28 October 2011 (UTC)		: I've attempted to clarify things somewhat by explaining concatenative languages as the subset of point-free languages in which concatenation of expressions (which should be clearer than "terms") denotes function composition. If you do not think this improves things sufficiently, please reinstate the technical notice. [[User:John Nowak\|John Nowak]] ([[User talk:John Nowak\|talk]]) 03:10, 28 October 2011 (UTC)

John Nowak at 03:10, 28 October 2011

2011-10-28T03:10:25Z

← Previous revision		Revision as of 03:10, 28 October 2011
Line 23:		Line 23:
	==Incomprehensible==		==Incomprehensible==
	I'm university level CompSci engineer, but don't understand this article because the terms are not back-referenced. For example "terms" is meaningless without either back-referencing the term "term" to one other programming or mathematical paradigm, such as logic programming or imperative. The article just seems to mumble its mind without any listeners. I think it is not understandable to anyone except anyone that already knows all about the topic. The terms must be better founded into a context. [[User:Rursus\|Rursus]] dixit. ([[User talk:Rursus\|<span style="color: red; background: #FFFF80"><sup>m</sup><u>bork<sup>3</sup></u></span>]]!) 15:50, 7 July 2011 (UTC)		I'm university level CompSci engineer, but don't understand this article because the terms are not back-referenced. For example "terms" is meaningless without either back-referencing the term "term" to one other programming or mathematical paradigm, such as logic programming or imperative. The article just seems to mumble its mind without any listeners. I think it is not understandable to anyone except anyone that already knows all about the topic. The terms must be better founded into a context. [[User:Rursus\|Rursus]] dixit. ([[User talk:Rursus\|<span style="color: red; background: #FFFF80"><sup>m</sup><u>bork<sup>3</sup></u></span>]]!) 15:50, 7 July 2011 (UTC)

			: I've attempted to clarify things somewhat by explaining concatenative languages as the subset of point-free languages in which concatenation of expressions (which should be clearer than "terms") denotes function composition. If you do not think this improves things sufficiently, please re-instate the technical notice. [[User:John Nowak\|John Nowak]] ([[User talk:John Nowak\|talk]]) 03:10, 28 October 2011 (UTC)

Rursus: /* Replacement */

2011-07-07T15:50:56Z

Replacement

← Previous revision		Revision as of 15:50, 7 July 2011
Line 20:		Line 20:

	Assuming there are no issues, I'll go ahead and switch the article to the new version.		Assuming there are no issues, I'll go ahead and switch the article to the new version.

			==Incomprehensible==
			I'm university level CompSci engineer, but don't understand this article because the terms are not back-referenced. For example "terms" is meaningless without either back-referencing the term "term" to one other programming or mathematical paradigm, such as logic programming or imperative. The article just seems to mumble its mind without any listeners. I think it is not understandable to anyone except anyone that already knows all about the topic. The terms must be better founded into a context. [[User:Rursus\|Rursus]] dixit. ([[User talk:Rursus\|<span style="color: red; background: #FFFF80"><sup>m</sup><u>bork<sup>3</sup></u></span>]]!) 15:50, 7 July 2011 (UTC)

← Previous revision		Revision as of 23:01, 26 June 2020
Line 35:		Line 35:
	: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])		: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-9\|Enchilada]],[[concatenative programming language#cite note-8\|XY]])

	: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])		: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-9\|Enchilada]],[[concatenative programming language#cite note-8\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

← Previous revision		Revision as of 16:40, 7 October 2012
Line 30:		Line 30:
	How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)		How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)

	: AFAIK ~~there is some relationships~~:		: AFAIK:

			: [[tacit programming\|point-free]] [[intersection (set theory)\|∩]] [[functional programming\|functional]]=[[function-level programming\|function-level]]

	: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])		: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])
Line 38:		Line 40:
	: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])		: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

	: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])		: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]], not [[tacit programming\|point-free]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]]) or without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])
Line 44:		Line 46:
	: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])		: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

	: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages~~, it is a [[subset]]~~. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)		: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)

← Previous revision		Revision as of 14:17, 7 October 2012
Line 29:		Line 29:

	How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)		How does concatenative programming compare to Backus-style [[function-level programming]]? They both emphasize the [[point-free style]], so what is the difference? —''[[User:Ruud Koot\|Ruud]]'' 15:08, 19 February 2012 (UTC)

			: AFAIK there is some relationships:

			: [[tacit programming\|point-free]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[tacit programming\|point-free]] with [[order of operations]] (eg [[Haskell (programming language)\|Haskell]])

			: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[tacit programming\|point-free]]=[[concatenative programming language\|concatenative]] with [[anonymous function\|λ-abstraction]] (eg [[concatenative programming language#cite note-6\|Enchilada]],[[concatenative programming language#cite note-5\|XY]])

			: [[function-level programming\|function-level]] [[complement (set theory)#relative_complement\|\]] [[concatenative programming language\|concatenative]]=[[function-level programming\|function-level]] with [[order of operations]](eg [[FP (programming_language)\|FP]],[[FL (programming_language)\|FL]],[[FPr (programming_language)\|FPr]],[[j (programming_language)\|J]])

			: [[concatenative programming language\|concatenative]] [[complement (set theory)#relative_complement\|\]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] without [[higher-order function\|higher-order functions]] (eg [[forth (programming language)\|Forth]])

			: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[function-level programming\|function-level]]=[[concatenative programming language\|concatenative]] with [[higher-order function\|higher-order functions]] (eg [[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

			: [[concatenative programming language\|concatenative]] [[intersection (set theory)\|∩]] [[tacit programming\|point-free]]=[[stack-oriented programming language\|stack-oriented]] (eg [[forth (programming language)\|Forth]],[[cat (programming language)\|Cat]],[[joy (programming language)\|Joy]])

			: If this is right, the article (after expliciting the relationship) should be cleaned to not hold examples of [[stack-oriented programming language\|stack-oriented]] languages, it is a [[subset]]. -[[Special:Contributions/189.26.152.54\|189.26.152.54]] ([[User talk:189.26.152.54\|talk]]) 14:17, 7 October 2012 (UTC)