Proof nets, garbage, and computations

Stefano Guerrini, Simone Martini, Andrea Masini
2001 Theoretical 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 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 con uent. The proofs are all based on pure syntactical reasonings.
doi:10.1016/s0304-3975(00)00094-3 fatcat:eqte4g7d4zezhcpbaywtrgo2u4