Simple translation of goal-directed evaluation

Authors:
Todd A. Proebsting
Affiliations:
Department of Computer Science, University of Arizona, Tucson, AZ
Venue:
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Year:
1997

Citing 6
Cited 2

The implementation of the Icon programming language

The implementation of the Icon programming language
A recursive interpreter for the Icon programming language

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Denotational semantics of a goal-directed language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstraction mechanisms in CLU

Communications of the ACM
Advanced Programming Language Design

Advanced Programming Language Design
ICON Programmng Language

ICON Programmng Language

An Operational Investigation of the CPS Hierarchy

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Defunctionalization at work

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simple, powerful and flexible technique for reasoning about and translating the goal-directed evaluation of programming language constructs that either succeed (and generate sequences of values) or fail. The technique generalizes the Byrd Box, a well-known device for describing Prolog backtracking.