## A general theory of sharing graphs (1999)

### Cached

### Download Links

- [www.ircs.upenn.edu]
- [ftp.dcs.qmw.ac.uk]
- [ftp.cis.upenn.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | THEORET. COMPUT. SCI |

Citations: | 4 - 3 self |

### BibTeX

@ARTICLE{Guerrini99ageneral,

author = {Stefano Guerrini},

title = {A general theory of sharing graphs},

journal = {THEORET. COMPUT. SCI},

year = {1999}

}

### OpenURL

### Abstract

Sharing graphs are the structures introduced by Lamping to implement optimal reductions of lambda calculus. Gonthier's reformulation of Lamping's technique inside Geometry of Interaction, and Asperti and Laneve's work on Interaction Systems have shown that sharing graphs can be used to implement a wide class of calculi. Here, we give a general characterization of sharing graphs independent from the calculus to be implemented. Such a characterization rests on an algebraic semantics of sharing graphs exploiting the methods of Geometry of Interaction. By this semantics we can de ne an unfolding partial order between proper sharing graphs, whose minimal elements are unshared graphs. The least-shared instance of a sharing graph is the unique unshared graph that the unfolding partial order associates to it. The algebraic semantics allows to prove that we can associate a semantical read-back to each unshared graph and that such a read-back can be computed