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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.