论文信息 - Embedding non‐determinism

Embedding non‐determinism

This note describes a method of enabling non‐deterministic algorithms to be written in conventional deterministic programming languages. The method involves a dynamic manipulation of stack contents, and is contrasted with standard techniques of implementing non‐deterministic programming languages.

John A. Self

[1] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.

[2] Richard Fikes,et al. REF-ARF: A System for Solving Problems Stated as Procedures , 1970, Artif. Intell..

[3] John A. Self,et al. Student Models in Computer-Aided Instruction , 1974, Int. J. Man Mach. Stud..

[4] Carl Hewitt,et al. Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot , 1972 .

[5] Robert W. Floyd,et al. Nondeterministic Algorithms , 1967, JACM.

[6] Daniel G. Bobrow,et al. A model and stack implementation of multiple environments , 1973, CACM.

[7] Jacques Cohen,et al. Non-Deterministic FORTRAN , 1974, Comput. J..