### Skapa referens, olika format (klipp och klistra)

**Harvard**

Gustavsson, J. och Sands, D. (2001) *Possibilities and Limitations of Call-by-Need Space Improvement*. : ACM Press

** BibTeX **

@conference{

Gustavsson2001,

author={Gustavsson, Jörgen and Sands, David},

title={Possibilities and Limitations of Call-by-Need Space Improvement},

booktitle={Proceeding of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01)},

pages={265-276},

abstract={Innocent-looking program transformations can easily change the space
complexity of lazy functional programs. The theory of space
improvement seeks to characterise those local program
transformations which are guaranteed never to worsen asymptotic space
complexity of any program. Previous work by the authors introduced the
space improvement relation and showed that a number of simple local
transformation laws are indeed space improvements. This paper seeks an
answer to the following questions: is the improvement relation inhabited
by interesting program transformations, and, if so, how might they be
established? We show that the asymptotic space improvement relation is
semantically badly behaved, but that the theory of strong space
improvement possesses a fixed-point induction theorem which permits
the derivation of improvement properties for recursive definitions.
With the help of this tool we explore the landscape of space improvement by
considering a range of classical program transformations.},

publisher={ACM Press},

year={2001},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 18063

A1 Gustavsson, Jörgen

A1 Sands, David

T1 Possibilities and Limitations of Call-by-Need Space Improvement

YR 2001

T2 Proceeding of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01)

SP 265

OP 276

AB Innocent-looking program transformations can easily change the space
complexity of lazy functional programs. The theory of space
improvement seeks to characterise those local program
transformations which are guaranteed never to worsen asymptotic space
complexity of any program. Previous work by the authors introduced the
space improvement relation and showed that a number of simple local
transformation laws are indeed space improvements. This paper seeks an
answer to the following questions: is the improvement relation inhabited
by interesting program transformations, and, if so, how might they be
established? We show that the asymptotic space improvement relation is
semantically badly behaved, but that the theory of strong space
improvement possesses a fixed-point induction theorem which permits
the derivation of improvement properties for recursive definitions.
With the help of this tool we explore the landscape of space improvement by
considering a range of classical program transformations.

PB ACM Press

LA eng

LK http://www.cs.chalmers.se/~dave/papers/PossibilitiesICFP01.pdf

OL 30