Proof nets, garbage, and computations [chapter]

S. Guerrini, S. Martini, A. Masini
1997 Lecture Notes in Computer Science  
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty i s 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 con uent.
doi:10.1007/3-540-62688-3_36 fatcat:e7d5sctfkfcg5ih24rmieubd5a