concatenative programming language

In concatenative programming languages, the concatenation of appropriate programs denotes the composition of the functions which the programs denote. Operations map an input stack into a results stack, and so it is possible to repeatedly concatenate a sequence of operations. A programming language is concatenative (and not applicative) when:

The elementary well-formed expressions of the language are monadic functions of a nameless data stack.
If X and Y are well-formed expressions, then the concatenation of X and Y is well-formed.
If Z is the concatenation of X and Y, then the value of Z is the composition of the values of X and Y.

Examples

The canonical examples of concatenative programming languages are Forth and Joy. In Joy, the program fragment:

2 7 +

Pushes "2" then "7" onto the stack. The "+" operator then replaces the stack with a new stack that contains the resulting sum "9", this notation is also known as "Reverse Polish notation". The contains an exhaustive list of those known to Wikipedia.

External links

<< Previous

Word Browser

Next >>

jalal al e ahmad
nga (british trades union)
lindley
kimberworth
mixed company
list of lieutenant governors of texas
six flags new england
hms palomares
slcm
cirrus airlines
edwin astley

parsing expression grammar
internet tax nondiscrimination act
rad racer
kakabeka falls
2001 cincinnati riots
jimmy ryan (baseball player)
bianchi
raf dishforth
northwestern ontario sports hall of fame
ski marathon
shyam benegal

ouimet canyon
andre dawson
shepperton
lynn herring
pierre fabre group
victoria, malta
krller mller museum
preaching
digital monkey
1930 in india
city of brass

kristina
hamburger schule
sea king
king of burundi
new swabia
barnfield pit
colonial heads of mozambique
indian nationality law
fiend without a face
asansol
ken salazar