associons(ID:6032/ass010)

Tuple based programming extensions 

First thought of by Dijkstra, implemented partially by Dijkstra, Rem and Feijer in 1974, and fully realised in Rem's PhD in 1976


Related languages
APL => associons   Influence
PLANNER => associons   Influence
References:
  • Rem, Martin "Associons: A Program Notation with Tuples Instead of Variables" pp251-262 view details Abstract: 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. Extract: Associons are ordered tuples of names
    Associons are ordered tuples of names. They are denoted as lists of names enclosed by parentheses. Each associon represents a relation between the entities with these names. Associons can be present or absent. The presence of an associon is interpreted as the established truth of the relation represented by that associon. All entities to which a computation refers are identified by mutually distinct names.


          in TOPLAS 3(3) July 1981 view details