Content deleted Content added
m Date maintenance tags and general fixes: build 414: |
m Link to garbage collection explanation. |
||
Line 13:
* Any subexpression can be replaced with a name that represents the same subexpression. This is referred to in the concatenative community as [[Code refactoring|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]].<ref>[http://www.latrobe.edu.au/philosophy/phimvt/joy/j02maf.html von Thun, Manfred: Mathematical foundations of Joy]</ref>
* Concatenative languages can be made well-suited to an implementation inspired by [[linear logic]] where no [[Garbage (computer science)|garbage]] is ever generated.<ref>[http://home.pipeline.com/~hbaker1/ForthStack.html Henry Baker: Linear Logic and Permutation Stacks — The Forth Shall Be First]</ref>
==Implementations==
| |||