AbstractIf it can be determined at compile-time how many times values will be used within lazy functional programs, a number of useful optimisations can be performed. For example, call-by-need parameter passing can be converted to call-by-name, and in-place updating and compile-time garbage collection can be performed. In this paper, it is shown how this usage counting information can be obtained by static analysis. This analysis is not itself a major contribution of this paper; similar analyses have been defined before. The major contributions of this paper are that it provides a framework against which this analysis can be proved correct for a lazy functional language, and the analysis is proved to be correct with respect to this framewor...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...
AbstractThe article presents an algorithm for the destructive update optimization in first-order laz...
This paper presents a novel type-and-effect analysis for pre-dicting upper-bounds on memory allocati...
Functional languages offer a number of advantages over their imperative counterparts. However, a su...
Functional languages offer a number of advantages over their imperative counterparts. However, a su...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
Lazy functional languages are known for their semantic elegance. They liberate programmers from many...
Automatic memory management is an important concept in many high order languages. It improves produc...
This paper describes the first successful attempt, of which we are aware, to define an automatic, ty...
We describe the design, implementation and use of a new kind of profiling tool that yields valuable ...
. This paper will present an analysis for detecting single uses of values in functional programs du...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...
AbstractThe article presents an algorithm for the destructive update optimization in first-order laz...
This paper presents a novel type-and-effect analysis for pre-dicting upper-bounds on memory allocati...
Functional languages offer a number of advantages over their imperative counterparts. However, a su...
Functional languages offer a number of advantages over their imperative counterparts. However, a su...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
Lazy functional languages are known for their semantic elegance. They liberate programmers from many...
Automatic memory management is an important concept in many high order languages. It improves produc...
This paper describes the first successful attempt, of which we are aware, to define an automatic, ty...
We describe the design, implementation and use of a new kind of profiling tool that yields valuable ...
. This paper will present an analysis for detecting single uses of values in functional programs du...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...
AbstractThe article presents an algorithm for the destructive update optimization in first-order laz...
This paper presents a novel type-and-effect analysis for pre-dicting upper-bounds on memory allocati...