Content deleted Content added
Diego Moya (talk | contribs) Intuitive explanation |
Diego Moya (talk | contribs) No edit summary |
||
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 typically don't represent the data structures they operate on with explicit names or [[identifier#In computer science|identifiers]]; instead, 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.
The combination of a compositional [[Semantics of programming languages|semantics]] with a [[Syntax of programming languages|syntax]] that mirrors such a semantics makes concatenative languages highly amenable to algebraic manipulation.<ref>[http://www.latrobe.edu.au/philosophy/phimvt/joy/j00rat.html Rationale for Joy, a functional language]{{dead link|date=July 2013}}</ref>
| |||