All objects are heap allocated. An object reference is the address where it s allocated. Every object has an extra eld that indicates its type. Representing type information in dynamically typed language . Technical Report TR 93-27, Department of Computer Science, The University of Arizona, oct 1993.
All threads can then continue.
The local algorithm is optimized to bind local variables locally. The implementation further optimizes the definition by doing binding in place and dereferencing inline. Common cases of unification such as parameter passing and local variable initialization do not need binding nor dereferencing, but reduce to single register moves or stores. Representing type information in dynamically typed languages . Technical Report TR93-27, University of Arizona, Department of Computer Science, September 1993.