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.
|Number of pages
|SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
|Published - May 1997
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design