Sharing Implementations of Graph Rewriting Systems
Stefano Guerrini · Electronic Notes in Theoretical Computer Science · 2005
Sharing graphs are a brilliant solution to the implementation of Lévy optimal reductions of λ-calculus. Sharing graphs are interesting on their own and optimal sharing reductions are just a particular reduction strategy of a more general sharing reduction system. The paper is a gentle introduction to sharing graphs and tries to confute some of the common myths on the difficulty of sharing implementations.