Language facilities for programmable backtracking

Authors:
Ralph E. Griswold;David R. Hanson
Affiliations:
Department of Computer Science, The University of Arizona, Tucson, Arizona;Department of Computer Science, Yale University, New Haven, Connecticut
Venue:
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Year:
1977

Citing 8
Cited 3

New Programming Languages for Artificial Intelligence Research

ACM Computing Surveys (CSUR)
The SL5 procedure mechanism

Communications of the ACM
Actor semantics of PLANNER-73

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A procedure mechanism for backtrack programming

ACM '76 Proceedings of the 1976 annual conference
String analysis and synthesis in SL5

ACM '76 Proceedings of the 1976 annual conference
A procedural approach to pattern matching in SNOBOL4

ACM '74 Proceedings of the 1974 annual conference - Volume 1
LAMBDA: The Ultimate Declarative

LAMBDA: The Ultimate Declarative
An overview of SL5

ACM SIGPLAN Notices

Non-Deterministic Algorithms

ACM Computing Surveys (CSUR)
Backtracking in a Generalized Control Setting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Referencing and Retention in Block-Structured Coroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most languages intended for artificial intelligence applications include a search and backtracking facility. While built-in backtracking facilities are convenient, they are often too inflexible for use beyond a limited range of applicability. Other mechanisms, such as those based on explicit manipulations of bindings or stack frames, tend to be very unstructured, and give the programmer little control over the backtracking process. This paper describes the SL5 programming language and its use for “programmable backtracking.” SL5 includes a general procedure mechanism that permits procedures to be used as recursive functions or as coroutines. Using this mechanism, the programmer can construct control hierarchies that are tailored to the specific application. A string pattern-matching facility is given as an example of the use of the SL5 facilities.