Revision as of 11:11, 13 September 2013 edit Diego Moya (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,477 edits →External links: Main cat ← Previous edit		Revision as of 11:34, 13 September 2013 edit undo Diego Moya (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,477 edits Usages and benefits, and drawbacks (edited with ProveIt) Next edit →
Line 14: <code>foo bar baz</code> 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. of programs;<ref>[http://www.latrobe.edu.au/philosophy/phimvt/joy/j00rat.html Rationale for Joy, a functional language]{{dead link\|date=July 2013}}</ref> although it may be difficult to write mathematical expressions directly in them.<ref name="whymatters"/> Concatenative lanugages can be implemented in an efficient way with a [[stack machine]], and are a common strategy to program [[virtual machine]]s. <ref name="whymatters">{{cite web \| url=http://evincarofautumn.blogspot.com.es/2012/02/why-concatenative-programming-matters.html \| title=Why Concatenative Programming Matters \| accessdate=13 September 2013}}</ref> Much of the original work on concatenative language theory was carried out by [[Manfred von Thun]].

Concatenative programming language: Difference between revisions