Avoiding Unnecessary Updates

John Launchbury; Andy Gill; John Hughes; Simon Marlow; Simon Peyton Jones; Philip Wadler

Avoiding Unnecessary Updates

John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon Peyton Jones, Philip Wadler

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no other computation requires this value, so the update is unnecessary. In this paper we take some steps towards an analysis for determining when these updates may be omitted.

Original language	English
Title of host publication	In Glasgow Workshop on Functional Programming
Publisher	Springer
Pages	144-153
Publication status	Published - 1992

Cite this

@inproceedings{28ab42c0f91b4b20b846f18c29e42199,

title = "Avoiding Unnecessary Updates",

abstract = "Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no other computation requires this value, so the update is unnecessary. In this paper we take some steps towards an analysis for determining when these updates may be omitted. ",

author = "John Launchbury and Andy Gill and John Hughes and Simon Marlow and Jones, {Simon Peyton} and Philip Wadler",

year = "1992",

language = "English",

pages = "144--153",

booktitle = "In Glasgow Workshop on Functional Programming",

publisher = "Springer",

address = "United Kingdom",

}

TY - GEN

T1 - Avoiding Unnecessary Updates

AU - Launchbury, John

AU - Gill, Andy

AU - Hughes, John

AU - Marlow, Simon

AU - Jones, Simon Peyton

AU - Wadler, Philip

PY - 1992

Y1 - 1992

N2 - Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no other computation requires this value, so the update is unnecessary. In this paper we take some steps towards an analysis for determining when these updates may be omitted.

AB - Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no other computation requires this value, so the update is unnecessary. In this paper we take some steps towards an analysis for determining when these updates may be omitted.

M3 - Conference contribution

SP - 144

EP - 153

BT - In Glasgow Workshop on Functional Programming

PB - Springer

ER -

Avoiding Unnecessary Updates

Abstract / Description of output

Fingerprint

Cite this