Università di Pisa
Sistema bibliotecario di ateneo

Parsing MELL Proof Nets

Guerrini, S. and Masini, A. (1996) Parsing MELL Proof Nets. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (151Kb)


    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.

    Item Type: Book
    Uncontrolled Keywords: proof net, linear logic
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 26 Jan 2015 14:29
    Last Modified: 26 Jan 2015 14:29
    URI: http://eprints.adm.unipi.it/id/eprint/1956

    Repository staff only actions

    View Item