The maintenance of intermediate values in goal-directed evaluation

Authors:
Kenneth Walker;Ralph E. Griswold
Affiliations:
The Univ. of Arizona, Tuczon;The Univ. of Arizona, Tuczon
Venue:
ACM Letters on Programming Languages and Systems (LOPLAS)
Year:
1992

Citing 9
Cited 0

Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
The implementation of the Icon programming language

The implementation of the Icon programming language
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
The implementation of an optimizing compiler for ICON

The implementation of an optimizing compiler for ICON
High-level data flow analysis

Communications of the ACM
The ICON Programming Language

The ICON Programming Language
Program Flow Analysis: Theory and Application

Program Flow Analysis: Theory and Application
The implementation of generators and goal-directed evaluation in icon

The implementation of generators and goal-directed evaluation in icon

Quantified Score

Hi-index	0.00

Visualization

Abstract

In programming languages that support goal-directed evaluation to make use of alternative results, an expression can produce a value, suspend, and later be resumed to produce another value. This causes control backtracking to earlier points in a computation and complicates the maintenance of intermediate values. This paper presents a space-efficient algorithm computing the lifetimes of intermediate values that is used by an optimizing compiler for the Icon programming language. The algorithm is applicable to other programming languages that employ goal-directed evaluation.