Kevin Hammond. "The spineless tagless G-Machine --- NOT!". Technical Report (not yet published), Department of Computer Science, Glasgow University, 1993.  Home/Search   Document Details and Download   Summary   Related Articles

....Hooked executable type code 5 5 test hookedness first 2 8 test type first 0 11 Table 5: Costs of Hooked Values that the choice of which is the best scheme depends on what percentage of values are found to be hooked at run time. These figures are partially confirmed by the experiments reported in [10] where there is also a discussion of re introducing tags to speed up the case where the value is not hooked. Note that the techniques of executable type descriptions are not restricted to object pointer schemes. Such type descriptions could be used quite easily with large wrappers, and any ....

Kevin Hammond. "The spineless tagless G-Machine --- NOT!". Technical Report (not yet published), Department of Computer Science, Glasgow University, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC