Sharing graphs are an implementation of linear logic proof-nets in which a redex is never duplicated. In their usual formulation, sharing graphs present a problem of coherence; we solve this problem by changing the way the information is coded into sharing graphs and introducing a new reduction rule
Coherence for sharing proof nets
MASINI, Andrea
1996-01-01
Abstract
Sharing graphs are an implementation of linear logic proof-nets in which a redex is never duplicated. In their usual formulation, sharing graphs present a problem of coherence; we solve this problem by changing the way the information is coded into sharing graphs and introducing a new reduction rule
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
