[<<][packetforth][>>][..]
Tue Jun 5 00:08:51 CEST 2007

linear lisp

http://home.pipeline.com/~hbaker1/LinearLisp.html

PF is almost the same: lists have RC = 1 (not counting pointers, i use
as non-linear cheating without GC) and atoms can be packets, which are
ref-counted.

so, basicly. there are only 2 different types: cons cells which always
have reference cout = 1, and atoms which are not (necessarily) managed.

in the paper above, FREE, COPY and EQUAL are first constructed as
deconstruct/construct operations, and later made more efficient by
implementing them as primitives, but preserving the linearity.

i don't get the "hash consing" part though..



[Reply][About]
[<<][packetforth][>>][..]