Proof nets, garbage, and computations
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. The proofs are all based on pure syntactical reasonings. (C) 2001 Elsevier Science B,V. All rights reserved.
proof nets linear logic cut-elimination typed lambda-calculus sharing graphs