Simple Translation of Goal-Directed Evaluation

Todd A. Proebsting

doi:10.1145/258916.258917

Simple Translation of Goal-Directed Evaluation

Research output: Contribution to journal › Article › peer-review

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.

Original language	English (US)
Pages (from-to)	1-6
Number of pages	6
Journal	SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume	32
Issue number	5
DOIs	https://doi.org/10.1145/258916.258917
State	Published - May 1997

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design

Access to Document

10.1145/258916.258917

Cite this

@article{70cc6ad6182c42ddb0ec05d914d12b8d,

title = "Simple Translation of Goal-Directed Evaluation",

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.",

author = "Proebsting, {Todd A.}",

year = "1997",

month = may,

doi = "10.1145/258916.258917",

language = "English (US)",

volume = "32",

pages = "1--6",

journal = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)",

issn = "0362-1340",

publisher = "Association for Computing Machinery (ACM)",

number = "5",

}

TY - JOUR

T1 - Simple Translation of Goal-Directed Evaluation

AU - Proebsting, Todd A.

PY - 1997/5

Y1 - 1997/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0347304630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347304630&partnerID=8YFLogxK

U2 - 10.1145/258916.258917

DO - 10.1145/258916.258917

M3 - Article

AN - SCOPUS:0347304630

SN - 0362-1340

VL - 32

SP - 1

EP - 6

JO - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

JF - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

IS - 5

ER -

Simple Translation of Goal-Directed Evaluation

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this