Concatenative programming language: Difference between revisions

Revision as of 11:34, 13 September 2013

Revision as of 12:00, 13 September 2013

Line 2:

{{Programming paradigms}}

A '''concatenative programming language''' is a [[Point-free programming|point-free]] programming language in which all expressions denote [[Function (mathematics)|functions]] and the [[juxtaposition (mathematics)|juxtaposition]] of expressions denotes [[function composition]].<ref name="dobbscodetalk">{{cite web|url=http://drdobbs.com/blogs/architecture-and-design/228701299 |title=Christopher Diggins: What is a concatenative language |publisher=Drdobbs.com |date=2008-12-31 |accessdate=2013-07-01}}</ref> Concatenative programming replaces [[function application]], which is common in other programming styles, with [[function composition (computer science)|function composition]] as the default way to build [[subroutine]]s. Functions and procedures written in concatenative style are not [[Value-level programming|value level]], i.e. they typically don't represent the data structures they operate on with explicit names or [[identifier#In computer science|identifiers]]; instead, they are [[Function-level programming|function level]]- a function is defined as a [[pipeline (software)|pipeline]] -, a sequence of operations that take parameters from an implicit data structure on which all functions operate, and return the function results to that shared structure so that it will be used by the next operator.<ref>{{cite web | url=http://concatenative.org/wiki/view/Concatenative%20language | title=Concatenative language | publisher=Concatenative.org | accessdate=13 September 2013}}</ref>

For example, a sequence of operations in an applicative language like the following: