A program notation without variables is proposed. The state of a computation is recorded as a set of "associons." Each associon is a tuple of names representing a relation between the entities with those names. The state of the computation can be changed by the creation of new associons representing new relations deducible from those already recorded. The building block prescribing such deductions is called the "closure statement." The notation proposed is the result of our search for a basic statement the execution of which may employ more concurrency than is the case for the traditional assignment statement. Some possible extensions to the notation are discussed.
|Number of pages||12|
|Journal||ACM Transactions on Programming Languages and Systems|
|Publication status||Published - 1981|