Parsing mell proof nets (1997)
Cached
Download Links
- [www.ircs.upenn.edu]
- [ftp.di.unipi.it]
- [ftp.cis.upenn.edu]
- [www.daimi.aau.dk]
- [ftp.dcs.qmw.ac.uk]
- [ftp.di.unipi.it]
- DBLP
Other Repositories/Bibliography
by
Stefano Guerrini
,
Andrea Masini
| Venue: | In TLCA |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Guerrini97parsingmell,
author = {Stefano Guerrini and Andrea Masini},
title = {Parsing mell proof nets},
booktitle = {In TLCA},
year = {1997},
publisher = {London Mathematical Society}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 de ned by such a rewriting system (con uent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the Danos-Regnier one. 1
Citations
| 115 | The Structure of Multiplicatives - Danos, Regnier - 1989 |
| 50 | From proof nets to interaction nets - Lafont - 1995 |
| 44 | Lambda-calcul et réseaux - Regnier - 1992 |
| 18 | Deciding provability of linear logic formulas - Lincoln - 1995 |
| 11 | On the ne structure of the exponential rule - Martini, Masini - 1978 |
| 7 | Coherence for sharing proof-nets - Guerrini, Martini, et al. - 1996 |
| 7 | Proof nets, garbage, and computations - Guerrini, Martini, et al. |
| 5 | Theoretical and Practical Issues of Optimal Implementations of Functional Languages - Guerrini - 1996 |
| 2 | Sequent reconstruction in LLM|A sweepline proof - Banach - 1995 |
| 1 | Deciding provability oflinear logic formulas - Lincoln - 1995 |
