Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2016.20
URN: urn:nbn:de:0030-drops-60031
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6003/
Guerrieri, Giulio ; Pellissier, Luc ; Tortora de Falco, Lorenzo
Computing Connected Proof(-Structure)s From Their Taylor Expansion
| pdf-format: |
|
Abstract
We show that every connected Multiplicative Exponential Linear Logic (MELL) proof-structure (with or without cuts) is uniquely determined by a well-chosen element of its Taylor expansion: the one obtained by taking two copies of the content of each box. As a consequence, the relationalmodel is injective with respect to connected MELL proof-structures.
BibTeX - Entry
@InProceedings{guerrieri_et_al:LIPIcs:2016:6003,
author = {Giulio Guerrieri and Luc Pellissier and Lorenzo Tortora de Falco},
title = {{Computing Connected Proof(-Structure)s From Their Taylor Expansion}},
booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-010-1},
ISSN = {1868-8969},
year = {2016},
volume = {52},
editor = {Delia Kesner and Brigitte Pientka},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6003},
URN = {urn:nbn:de:0030-drops-60031},
doi = {10.4230/LIPIcs.FSCD.2016.20},
annote = {Keywords: proof-nets, (differential) linear logic, relational model, Taylor expansion}
}
| Keywords: | proof-nets, (differential) linear logic, relational model, Taylor expansion | |
| Seminar: | 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 17.06.2016 |
