The focus of this paper are space-improvements of programs, which are transformations that do not worsen the space requirement during evaluations. A realistic theoretical treatment must take garbage collection method into account. We investigate space improvements under the assumption of an optimal garbage collector. Such a garbage collector is not implementable, but there is an advantage: The investigations are independent of potential changes in an implementable garbage collector and our results show that the evaluation and other similar transformations are space-improvements
ABSTRACT — The fundamental challenge of garbage collector (GC) design is to maximize the recycled sp...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
Innocent-looking program transformations can easily change the space complexity of lazy functional ...
Existing techniques for garbage collection and machine code optimizations can interfere with each ot...
Abstract This paper describes a general approach for optimized live heap space and live heap space-b...
Both type-accurate and conservative garbage collectors have gained in importance since the original ...
Generational techniques have been very successful in reducing the impact of garbage collection algor...
Automatic memory management is an important concept in many high order languages. It improves produc...
This paper describes a general approach for optimized live heap space and live heap space-bound anal...
Programmers are increasingly choosing managed languages for modern applications, which tend to alloc...
(Appendix to SICS Research Report R86009) This appendix shows in detail how to make the time for the...
tions expressed in this material are those of the authors and do not necessarily reflect the views o...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
ABSTRACT — The fundamental challenge of garbage collector (GC) design is to maximize the recycled sp...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
Innocent-looking program transformations can easily change the space complexity of lazy functional ...
Existing techniques for garbage collection and machine code optimizations can interfere with each ot...
Abstract This paper describes a general approach for optimized live heap space and live heap space-b...
Both type-accurate and conservative garbage collectors have gained in importance since the original ...
Generational techniques have been very successful in reducing the impact of garbage collection algor...
Automatic memory management is an important concept in many high order languages. It improves produc...
This paper describes a general approach for optimized live heap space and live heap space-bound anal...
Programmers are increasingly choosing managed languages for modern applications, which tend to alloc...
(Appendix to SICS Research Report R86009) This appendix shows in detail how to make the time for the...
tions expressed in this material are those of the authors and do not necessarily reflect the views o...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
ABSTRACT — The fundamental challenge of garbage collector (GC) design is to maximize the recycled sp...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...