We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic proof nets. The main novelty lies in a complete set of rewriting rules for cut-elimination in the presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent.
Titolo: | Proof nets, garbage, and computations |
Autori: | |
Data di pubblicazione: | 1997 |
Abstract: | We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic proof nets. The main novelty lies in a complete set of rewriting rules for cut-elimination in the presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. |
Handle: | http://hdl.handle.net/11562/430366 |
Appare nelle tipologie: | 04.01 Contributo in atti di convegno |
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.