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 | 1-6 |
| Number of pages | 6 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 ACM SIGPLAM Conference on Programming Language Design and Implementation, PLDI - Las Vegas, NV, USA Duration: Jun 15 1997 → Jun 18 1997 |
Other
| Other | Proceedings of the 1997 ACM SIGPLAM Conference on Programming Language Design and Implementation, PLDI |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 6/15/97 → 6/18/97 |
ASJC Scopus subject areas
- Software