Learn More
In this article a protocol for distributed reference counting is developed and proved correct. It is pointed out, how it can be used to detect instemces where update in place is allowed. An implementation scheme is presented that requires bookkeeping messages only for tire copying of references across processor boundaries and for the deletion of references(More)
Call-by-need is widely regarded as an optimal (to within a constant factor) parameter passing mechanism for functional programming languages. Except for certain special cases involving higher order functions, call-by-need is optimal with respect to time. However, call-by-need is far from optimal with respect to space. We examine some of the space problems(More)