Guerrini, StefanoMartini, SimoneMasini, Andrea2023-05-222023-05-2219972006-08-21https://repository.upenn.edu/handle/20.500.14332/37683We 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.Report