Bibliographic Details
| Title: |
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. |
| Authors: |
Bergstra, J.A.1 J.A.Bergstra@uva.nl, Middelburg, C.A.1 C.A.Middelburg@uva.nl |
| Source: |
Fundamenta Informaticae. 2013, Vol. 128 Issue 4, p367-412. 46p. |
| Subjects: |
Algebra software, Dynamic data exchange, Data structures, Molecular dynamics, Revision (Writing process), Data analysis, Garbage collection (Computer science) |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
