J-C. Raoult and R. Sethi. The global storage needs of a subcomputation. In 11th ACM Sym. on Prin. of Prog. Lang., pages 148--157, ACM, January 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... that can be updated destructively in this manner is said to be single threaded, a property that can be inferred via abstract reference counting as described here, or by a more direct (but perhaps less general) analysis as described in [10] It is also related to the pebbling games described in [9]. 8 Extensions There are several extensions to the analysis that should be straightforward, such as adding constants that may be pass by reference (i.e. that are initially allocated in the store) and allowing nested equation groups or LET expressions. It should also be possible to allow arrays ....

J-C. Raoult and R. Sethi. The global storage needs of a subcomputation. In 11th ACM Sym. on Prin. of Prog. Lang., pages 148--157, ACM, January 1984.

....[24] in this case no new typing discipline is necessary. Under this approach the programmer is able and has to reason about order of evaluation and space utilization of the program. This may be regarded as a benefit or as a drawback. Related are also the work done by Raoult and Sethi [17] who have studied single threading using a pebble game on a program tree. Let us also mention studies aiming at reducing storage allocations for dynamic data structures [10,12] by doing a sharing analysis on strict, first order, languages. 6.2 Future work We did not consider product types in this ....

J.-C. Raoult and R. Sethi. The global storage needs of a subcomputation. In Proc. ACM Symp. on Princ. of Prog. Lang., 1984, 148-157.

....reasoning, so each could be used where appropriate. This paper extends the operational part of the proof by showing how the tree rewriting systems can be implemented in a conventional storage model, and how that implementation can be proved correct using operational reasoning. Raoult and Sethi [14] and Schmidt [16] considered the issue of single threading: when a particular term (or class of terms) could be represented by a single destructivelyupdated quantity, but they did not consider the representation of such quantities in a linear store. Hannan [7] showed how certain classes of ....

Raoult, J.-C. and Sethi, R. "The Global Storage Needs of a Subcomputation," Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 148--157.

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