2 ms·
While we're at it, maybe we might relate this to consuming values by using them, and creating explicit copies when we need to consume them more than once. This
by Dewie 12y ago
While we're at it, maybe we might relate this to consuming values by using them, and creating explicit copies when we need to consume them more than once. This avoids having to deal with any kind of garbage collection or reference counting, but you have to do the copying of the whole data structure instead of copying the (sometimes/often) smaller pointers to the data itself (random access).
There was some work on this by someone, called something like Linear Lisp. It looked like Forth with parenthesis.
- DougMerritt 12y agoThe illustrious Henry Baker, based on the slightly earlier (and extremely influential) Linear Logic. http://www.pipeline.com/~hbaker1/LinearLisp.html http://www.pipeline.com/~hbaker1/LinearLisp.html There's a conceptual relationship to SSA (static single assignment) http://en.wikipedia.org/wiki/Static_single_assignment_form http://en.wikipedia.org/wiki/Static_single_assignment_form
- agumonkey 12y agoThis is a wonderful read. Opens your eyes on how different things can be done under the hood.