Simple Translation of Goal-Directed Evaluation

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)1-6
Number of pages6
JournalSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume32
Issue number5
StatePublished - May 1997

Fingerprint

Computer programming languages

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Simple Translation of Goal-Directed Evaluation. / Proebsting, Todd A.

In: SIGPLAN Notices (ACM Special Interest Group on Programming Languages), Vol. 32, No. 5, 05.1997, p. 1-6.

Research output: Contribution to journalArticle

@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 = "5",
language = "English (US)",
volume = "32",
pages = "1--6",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
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

M3 - Article

AN - SCOPUS:0347304630

VL - 32

SP - 1

EP - 6

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 5

ER -