IRCS Technical Reports Series

Document Type

Technical Report

Date of this Version

October 1996


University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-96-37.


We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar defined by such a rewriting system (confluent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the Danos-Regnier one.



Date Posted: 14 September 2006