Concatenative programming language: Difference between revisions

Revision as of 15:54, 7 July 2011

Revision as of 17:24, 21 August 2011

Line 3:

{{Programming paradigms}}

A '''concatenative programming language''' is one in which all terms denote [[Function (mathematics)|functions]] and the juxtaposition of terms denotes [[function composition]].<ref name="dobbscodetalk">[http://www.drdobbs.com/blogblogs/archivesarchitecture-and-design/2008/12/what_is_a_conca.html228701299 Christopher Diggins: What is a concatenative language]</ref> The combination of a compositional [[semantics]] with a [[Syntax of programming languages|syntax]] that mirrors such a semantics makes concatenative languages highly amenable to algebraic manipulation and formal analysis.<ref>[http://www.latrobe.edu.au/philosophy/phimvt/joy/j00rat.html Rationale for Joy, a functional language]</ref>

Much of the original work on concatenative language theory was carried out by [[Manfred von Thun]].