Parsing MELL proof nets

Authors
Guerrini, S Masini, A
Citation
S. Guerrini et A. Masini, Parsing MELL proof nets, THEOR COMP, 254(1-2), 2001, pp. 317-335
Citations number
17
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
254
Issue
1-2
Year of publication
2001
Pages
317 - 335
Database
ISI
SICI code
0304-3975(20010306)254:1-2<317:PMPN>2.0.ZU;2-W
Abstract
We propose a rewriting system for parsing full multiplicative and exponenti al proof structures. The recognizing grammar defined by such a rewriting sy stem (confluent and strongly normalizing) gives a correctness criterion tha t we show equivalent to the Danos-Regnier one. (C) 2001 Published by Elsevi er Science B.V.