User:John Nowak/Sandbox/Concatenative
A concatenative language is a non-applicative programming language in which all terms denote functions and the juxtaposition of functions denotes function composition.[1] The combination of a compositional semantics with a syntax that mirrors such a semantics makes concatenative languages highly amenable to algebraic manipulation and formal analysis.[2]
Much of the original work on concatenative language theory was carried out by Manfred von Thun. Today, the majority of discussion regarding concatenative languages takes place on the concatenative mailing list.
Properties
[edit]The properties of concatenative languages are the result of their compositional syntax and semantics:
- Concatenative languages are necessarily point-free as allowing terms to denote variables would violate the rule that all terms denote functions.
- The reduction of any expression is the simplification of one function to another function; it is never necessary to deal with the application of functions to objects.[3] This property separates them from the otherwise similar function-level languages of John Backus, which are applicative.
- Any subexpression can be replaced with a name that represents the same subexpression. This is referred to in the concatenative community as factoring and is used extensively to simplify programs into smaller parts.
- The syntax and semantics of concatenative languages form the algebraic structure of a monoid.[4]
- Concatenative languages are well-suited to a linear implementation.[5]
Implementations
[edit]The first concatenative programming language was Forth, although Joy was the first language to call itself concatenative. Other concatenative languages are Cat, Enchilada, Factor, Onyx, PostScript, RPL, Stappl, and XY.
Most existing concatenative languages are stack-based; this is not a requirement and other models have been proposed.[1] Concatenative languages are currently used for embedded, desktop, and web programming, as target languages, and for research purposes. Most concatenative languages are untyped, although Cat is typed and proposals for other typed languages have been made.[6]
See also
[edit]External links
[edit]- Manfred von Thun's Joy and concatenative theory website
- The concatenative mailing list
- concatenative.org: A wiki about concatenative languages
References
[edit]- ^ a b Concatenative mailing list discussion of the term "concatenative"
- ^ Rationale for Joy, a functional language
- ^ Joy compared with other functional languages.
- ^ concatenative mailing list: Is this language concatenative?
- ^ Henry Baker: Linear Logic and Permutation Stacks — The Forth Shall Be First
- ^ concatenative.org: 5th