Revision as of 16:57, 27 December 2009 edit John Nowak (talk \| contribs) 223 edits Re-added external links in external links section ← Previous edit		Revision as of 17:01, 27 December 2009 edit undo John Nowak (talk \| contribs) 223 edits Revised linear logic text and linked back to linear logic article Next edit →
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 aan ~~"linear~~implementation ~~logic"~~inspired ~~implementation,~~by ~~meaning~~[[linear logic]] ~~that~~where no 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==

Concatenative programming language: Difference between revisions