Adjunction for Garbage Collection with Application to Graph Rewriting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Adjunction for Garbage Collection with Application to Graph Rewriting

Rachid Echahed
Frederic Prost

Résumé

We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. We also show that garbage collection may be stated via a left adjoint, hence preserving colimits, followed by two right adjoints. These three adjoints cope well with the different phases of a traditional garbage collector. Consequently, our results should naturally help to better formulate graph transformation steps in order to get rid of garbage (unwanted nodes). We illustrate this point on a particular class of graph rewriting systems based on a double pushout approach and featuring edge redirection. Our approach gives a neat rewriting step akin to the one on terms, where garbage never appears in the reduced term.

Dates et versions

hal-00388331 , version 1 (26-05-2009)

Identifiants

Citer

Dominique Duval, Rachid Echahed, Frederic Prost. Adjunction for Garbage Collection with Application to Graph Rewriting. RTA'07 - Rewriting Techniques and Application 2007, Jun 2007, Paris, France. pp.122-136, ⟨10.1007/978-3-540-73449-9_11⟩. ⟨hal-00388331⟩
63 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More