Parsing MELL Proof Nets
Loading...
Penn collection
IRCS Technical Reports Series
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Guerrini, Stefano
Masini, Andrea
Contributor
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.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1996-10-01
Volume number
Issue number
Publisher
Publisher DOI
Comments
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-96-37.