Avoiding Unnecessary Updates

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationIn Glasgow Workshop on Functional Programming
PublisherSpringer-Verlag GmbH
Pages144-153
Publication statusPublished - 1992

Fingerprint

Dive into the research topics of 'Avoiding Unnecessary Updates'. Together they form a unique fingerprint.

Cite this