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 based on pure syntactical reasonings.

Authors

• Stefano Guerrini
• Simone Martini
• Andrea Masini

Keywords

• Linear logic
• Typed lambda-calculus
• Cut-elimination
• Sharing graphs
• Proof nets