Date of this Version
Sharing graphs are an implementation of linear logic proofnets in such a way that their reduction never duplicate a redex. In their usual formulations, proof-nets present a problem of coherence: if the proof-net N reduces by standard cutelimination to N’, then, by reducing the sharing graph of N we do not obtain the sharing graph of N’. We solve this problem by changing the way the information is coded into sharing graphs and introducing a new reduction rule (absorption). The rewriting system is confluent and terminating. The proof of this fact exploits an algebraic semantics for sharing graphs.
Date Posted: 26 August 2006