Asynchronous Backtrackable Communications in the SLOOP Object-Oriented Language
N. Signès, J.-P. Bodeveix, D. Plaindoux, F. Cabestre, Christian Percebois · Birkhäuser Basel eBooks · 1994
In this paper, we present the resolution algorithm of an extension of the Prolog language to backtrackable communications. This algorithm is based on a dependency graph recording the connections between communication points. An example illustrates the use of backtrackable communications into the SLOOP object-oriented language.