Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting

Article type: Research Article

Authors: Bergstra, J.A. | Middelburg, C.A.

Affiliations: Informatics Institute, University of Amsterdam, Science Park 904, 1098 XH Amsterdam, the Netherlands. {J.A.Bergstra,C.A.Middelburg}@uva.nl

Note: [] Address for correspondence: Informatics Institute, University of Amsterdam, Science Park 904, 1098 XH Amsterdam, the Netherlands

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.

Keywords: data linkage algebra, data linkage dynamics, garbage collection, priority rewrite system

DOI: 10.3233/FI-2013-950

Journal: Fundamenta Informaticae, vol. 128, no. 4, pp. 367-412, 2013