Category:Programming paradigm/Concatenative: Difference between revisions

Content added Content deleted

Inline

Latest revision as of 06:54, 22 August 2023

Concatenative programming passes a single data structure from function to function. With a concatenative language, concatenation is function composition. The concatenation of two programs is a valid program that passes this single data structure from the first program to the second program.

This single data structure is probably a stack. A concatenative language is probably a stack-oriented language. These languages tend to use reverse Polish notation with postfix operators. Programs push values on the data stack, then operate on those values. For example,

3 4 + might push 7.
9 7 - might push 2.
The concatenation 3 4 + 9 7 - might push both 2 and 7.
The concatenation 3 4 + 9 7 - * might push 14.

The major difference from other programming paradigms is, that concatenative languages have combinatory logic as the predominant computational approach compared to others which use Lambda calculus, or Turing machines.

This approach is possible in other programming languages also. For example the tacit programming style of APL and point free style of Haskell is similar to this.

Subcategories

This category has the following 33 subcategories, out of 33 total.

8

8th‎ (91 P)

A

Arturo‎ (1 C, 779 P)

B

Babel‎ (37 P)
Blue‎ (1 C, 7 P)
Burlesque‎ (1 C, 70 P)

C

Cat‎ (3 C, 3 P)
Curto‎ (3 P)

D

Dc‎ (3 C, 90 P)
Dt‎ (11 P)

F

Factor‎ (3 C, 1,001 P)
Forth‎ (3 C, 616 P)

G

Golfscript‎ (3 C, 30 P)

J

Joy‎ (3 C, 90 P)

K

Keg‎ (4 P)
Kitten‎ (3 P)
Klingphix‎ (46 P)

L

Lang5‎ (49 P)

M

Min‎ (121 P)
MontiLang‎ (12 P)

O

Oforth‎ (308 P)
Onyx‎ (3 C, 8 P)

P

Plorth‎ (2 P)
PostScript‎ (3 C, 91 P)

Q

Quackery‎ (702 P)

R

Raven‎ (3 C, 74 P)
Retro‎ (3 C, 101 P)
RPL‎ (1 C, 700 P)
RPL/2‎ (3 C, 1 P)

S

Shale‎ (1 C, 11 P)

T

Thyrd‎ (3 C, 1 P)
Toka‎ (3 C, 44 P)
Trith‎ (3 C, 21 P)

V

V‎ (3 C, 36 P)

@@ Line 4: / Line 4: @@
 This single data structure is probably a [[stack]]. A concatenative language is probably a ''stack-oriented language''. These languages tend to use reverse Polish notation with postfix operators. Programs push values on the data stack, then operate on those values. For example,
-* <tt>3 4 +</tt> might push 7.
+* <code>3 4 +</code> might push 7.
-* <tt>9 7 -</tt> might push 2.
+* <code>9 7 -</code> might push 2.
-* The concatenation <tt>3 4 + 9 7 -</tt> might push both 2 and 7.
+* The concatenation <code>3 4 + 9 7 -</code> might push both 2 and 7.
-* The concatenation <tt>3 4 + 9 7 - *</tt> might push 14.
+* The concatenation <code>3 4 + 9 7 - *</code> might push 14.
-The major difference from other programming paradigms is that concatenative languages have combinatory logic as the predominant computational approach compared to others which use Lambda calculus, or Turing machines.
+The major difference from other programming paradigms is, that concatenative languages have combinatory logic as the predominant computational approach compared to others which use Lambda calculus, or Turing machines.
-This approach is possible in other programming languages also. For example the tacit programming style of APL and point free style of haskell is similar to this.
+This approach is possible in other programming languages also. For example the [[tacit programming]] style of [[APL]] and point free style of [[Haskell]] is similar to this.