[<<][libprim][>>][..]
Sun Jan 24 14:13:43 EST 2016

Binary tree rewriter

The idea is to factor out the implementation of libprim, which has
opaque primitive objects, and a tree memory consisting of:

- data stack
- return stack
- freelist

Operations involve motion between these 3 stacks, or between the
freelist and the tree on top of the data stack.

Internally, there will be aliasing, but at the pf level this can be
completely hidden behind primitive operations.





[Reply][About]
[<<][libprim][>>][..]