Implementations of lazy functional languages have not as yet approached the speed of execution provided by imperative, or even non-lazy functional languages. It has been suggested that the answer to this problem lies with powerful analyses, based on abstract interpretation, such as strictness analyses that can deal with arbitrary data structures and higher-order functions. In this paper we present a break down of the benefits of a number of analyses, each performed at increasing levels of sphistication.
|Number of pages||23|
|Publication status||Published - Jun 1991|