Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting

Abstract

We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions. We describe the state changes and replies that result from performing those actions by means of a term rewriting system with rule priorities. The model in question is an upgrade of molecular dynamics. The upgrading is mainly concerned with the features to deal with values and the features to reclaim garbage.

Defects and Faults in Algorithms, Programs and Instruction Sequences

“…br is math/logicalimported-standard, 2. services for stack queue, Turing tape, both with bounded size and with infinite size" math/logical-imported-pseudo standard (though naming of methods and precise meaning of these may vary for source to source), 3. Data linkages ( [16,19]) used for the specification of garbage collection and shedding, math/logical-imported-incidental 4. various Maurer machines used in the theory of processor specification: math/logical-imported-ad hoc With an ambition to discuss complex examples, comes the need to have more complex services in stock. For modelling real time control systems (as specified in discrete time) comes the need for a library of services able to interact directly via synchronous or asynchronous communication; such definitions are currently unavailable.…”