R. Kowalski. Algorithms = Logic + Control. Communicatiosn of the ACM, 22(7):424--436, July 1979. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Coercion as a Metaphor for Computation - Jagannathan (Correct)
....value; an expression that accesses a record field bound to blocks until some other expression replaces the with a non unbound value. Insofar as it provides an explicit synchronization mechanism, unbound values in COE correspond roughly to I structures [6] found in Id [24] or logical variables [22, 30] found in logic languages. Each actor executes the same high level process repeatedly: 1) wait for new input, 2) attach result to the output stream and (3) recurse. For example, the actor waits for a new value for i to be attached to edge2 by false gate 1 . Once a value is written, the actor ....
R. Kowalski. Algorithms = Logic + Control. Communicatiosn of the ACM, 22(7):424--436, July 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC