IRCS Technical Reports Series
Title
Proof nets, Garbage, and Computations
Document Type
Technical Report
Date of this Version
January 1997
Abstract
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.
Download
Date Posted: 26 August 2006
Comments
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-97-02.