Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 92009892 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bergstra%2C+J%2EA%2E%22">Bergstra, J.A.</searchLink><relatesTo>1</relatesTo><i> J.A.Bergstra@uva.nl</i><br /><searchLink fieldCode="AR" term="%22Middelburg%2C+C%2EA%2E%22">Middelburg, C.A.</searchLink><relatesTo>1</relatesTo><i> C.A.Middelburg@uva.nl</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2013, Vol. 128 Issue 4, p367-412. 46p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algebra+software%22">Algebra software</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamic+data+exchange%22">Dynamic data exchange</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Molecular+dynamics%22">Molecular dynamics</searchLink><br /><searchLink fieldCode="DE" term="%22Revision+%28Writing+process%29%22">Revision (Writing process)</searchLink><br /><searchLink fieldCode="DE" term="%22Data+analysis%22">Data analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Garbage+collection+%28Computer+science%29%22">Garbage collection (Computer science)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=92009892 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.3233/FI-2013-950 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 46 StartPage: 367 Subjects: – SubjectFull: Algebra software Type: general – SubjectFull: Dynamic data exchange Type: general – SubjectFull: Data structures Type: general – SubjectFull: Molecular dynamics Type: general – SubjectFull: Revision (Writing process) Type: general – SubjectFull: Data analysis Type: general – SubjectFull: Garbage collection (Computer science) Type: general Titles: – TitleFull: Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bergstra, J.A. – PersonEntity: Name: NameFull: Middelburg, C.A. IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 08 Text: 2013 Type: published Y: 2013 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 128 – Type: issue Value: 4 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |
