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.

Proof nets, garbage, and computations

MASINI, Andrea
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.
Linear logic; proof nets; cut elimination
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/430366
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact