Data-Structure Rewriting

Simple item page
dc.creatorDuval, Dominique
dc.creatorEchahed, Rachid
dc.creatorProst, Frederic
dc.date2005-03-24
dc.date.accessioned2026-07-07T03:22:45Z
dc.date.available2026-07-07T03:22:45Z
dc.descriptionWe tackle the problem of data-structure rewriting including pointer redirections. We propose two basic rewrite steps: (i) Local Redirection and Replacement steps the aim of which is redirecting specific pointers determined by means of a pattern, as well as adding new information to an existing data ; and (ii) Global Redirection steps which are aimed to redirect all pointers targeting a node towards another one. We define these two rewriting steps following the double pushout approach. We define first the category of graphs we consider and then define rewrite rules as pairs of graph homomorphisms of the form "L <- K ->R". Unfortunately, inverse pushouts (complement pushouts) are not unique in our setting and pushouts do not always exist. Therefore, we define rewriting steps so that a rewrite rule can always be performed once a matching is found.
dc.identifierhttps://arxiv.org/abs/cs/0503065
dc.identifierhttp://arxiv.org/abs/cs/0503065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32676
dc.subjectProgramming Languages
dc.subjectData Structures and Algorithms
dc.subjectD1, D3, E1, F3.3, I1
dc.titleData-Structure Rewriting
dc.typetext

Files

Collections

arXiv