A. Bloss. Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. Ph.D. Thesis, Yale University, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....no longer needed, they can be reclaimed into a free storage list explicitly by the program without invoking a garbage collection process. When heap allocated objects are no longer needed, their storage can be reused directly in the allocation of new objects without invoking garbage collection. [11], 35] 41] 49] 50] 51] ffl Reference Counting Elimination : In reference counting, each object contains a count, called the reference count, of the number of references (pointers) pointing to it. Each time a reference is created or destroyed its reference count needs to be incremented or ....

.... evaluation by converting lazy evaluation into applicative order evaluation and thus reducing the overhead of lazy evaluation ( 36] 31] 63] 66] Information about the order of evaluation of the arguments to a function can be useful for a number of optimizations, including copy elimination ([11], 30] 35] and process scheduling in a parallel system [13] Information on the status of evaluation of arguments when they are demanded is useful for eliminating unnecessary checking [14] and for efficient storage management of delayed expressions (closures) These information can be ....

[Article contains additional citation context not shown here]

A. Bloss. Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. Ph.D. Thesis, Yale University, 1989.

.... Interest in the update problem dates back to the pioneering work of Darlington and Burstall [DB76] Syntactic constraints that guarantee the safety of in place update were suggested by Schmidt [Sch85] and a variety of semantic analysis techniques have been proposed, notably by Hudak and Bloss [Hud86, Blo89]. The thrust of this paper, as well as of the other attempts to apply linear logic [GH90, Wad90] is to use type reconstruction rather than semantic analysis to determine when in place update is safe. The prototypical example of type reconstruction is the Hindley Milner algorithm [Hin69, Mil78, ....

A. Bloss, Path analysis: using order-of-evaluation information to optimize lazy functional languages. Ph.D. thesis, Yale University, Department of Computer Science, 1989.

....be straightforward to transform any single threaded semantics (well, any one that doesn t discard its store) into an equivalent program with a linear store type. A great deal of work has gone into compile time analysis to determine when destructive updating is safe, notably by Bloss and Hudak [Blo89, BHY89, Hud86]; older analysis techniques for determining when list cells can be reused go back to Darlington and Burstall [DB76] Analysis techniques have the advantage that destructive updating can be inferred whether the user indicates it explictly or not. With linear types, the user must decide which types ....

A. Bloss, Path analysis: using order-of-evaluation information to optimize lazy functional languages. Ph.D. thesis, Yale University, Department of Computer Science, 1989.

No context found.

A. Bloss. Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. PhD thesis, Yale University, Department of Computer Science, 1988.

No context found.

A. Bloss. Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. PhD thesis, Yale University, Department of Computer Science, 1988.

No context found.

A. Bloss. Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. PhD thesis, Yale University, Department of Computer Science, 1988.

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