IRCS Technical Reports Series
Title
Document Type
Technical Report
Date of this Version
October 1996
Abstract
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
Comments
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-96-37.