Data linkage algebra, data linkage dynamics, and priority rewriting

TL;DR

This paper introduces an algebraic framework for modeling dynamic data structures in computations, using prioritized term rewriting to describe state changes, extending molecular dynamics with value handling and garbage collection.

Contribution

It presents a novel algebra of data linkages and a prioritized rewriting system to model state changes in dynamic data structures, enhancing molecular dynamics models.

Findings

Model effectively captures dynamic data structure states.

Rewriting system accurately describes state transitions.

Framework supports value management and garbage collection.

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.