Proof-Net as Graph, Taylor Expansion as Pullback

Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Downloads (Pure)

Abstract

We introduce a new graphical representation for multiplicative and exponential linear logic proof-structures, based only on standard labelled oriented graphs and standard notions of graph theory. The inductive structure of boxes is handled by means of a box-tree. Our proof-structures are canonical and allows for an elegant definition of their Taylor expansion by means of pullbacks.

Original languageEnglish
Title of host publicationLogic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings
EditorsRosalie Iemhoff, Michael Moortgat, Ruy de Queiroz
Place of PublicationBerlin, Germany
PublisherSpringer Verlag
Pages282-300
Number of pages19
ISBN (Print)9783662595329
DOIs
Publication statusE-pub ahead of print - 9 Jun 2019
Event26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019 - Utrecht, Netherlands
Duration: 2 Jul 20195 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11541 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019
CountryNetherlands
CityUtrecht
Period2/07/195/07/19

Keywords

  • Graph
  • Linear logic
  • Proof-net
  • Taylor expansion

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Guerrieri, G., Pellissier, L., & Tortora de Falco, L. (2019). Proof-Net as Graph, Taylor Expansion as Pullback. In R. Iemhoff, M. Moortgat, & R. de Queiroz (Eds.), Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings (pp. 282-300). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11541 LNCS). Berlin, Germany: Springer Verlag. https://doi.org/10.1007/978-3-662-59533-6_18

Proof-Net as Graph, Taylor Expansion as Pullback. / Guerrieri, Giulio; Pellissier, Luc; Tortora de Falco, Lorenzo.

Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. ed. / Rosalie Iemhoff; Michael Moortgat; Ruy de Queiroz. Berlin, Germany : Springer Verlag, 2019. p. 282-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11541 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Guerrieri, G, Pellissier, L & Tortora de Falco, L 2019, Proof-Net as Graph, Taylor Expansion as Pullback. in R Iemhoff, M Moortgat & R de Queiroz (eds), Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11541 LNCS, Springer Verlag, Berlin, Germany, pp. 282-300, 26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019, Utrecht, Netherlands, 2/07/19. https://doi.org/10.1007/978-3-662-59533-6_18
Guerrieri G, Pellissier L, Tortora de Falco L. Proof-Net as Graph, Taylor Expansion as Pullback. In Iemhoff R, Moortgat M, de Queiroz R, editors, Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Berlin, Germany: Springer Verlag. 2019. p. 282-300. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-59533-6_18
Guerrieri, Giulio ; Pellissier, Luc ; Tortora de Falco, Lorenzo. / Proof-Net as Graph, Taylor Expansion as Pullback. Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. editor / Rosalie Iemhoff ; Michael Moortgat ; Ruy de Queiroz. Berlin, Germany : Springer Verlag, 2019. pp. 282-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cc2535dbce5c49399ffad099e627a66b,
title = "Proof-Net as Graph, Taylor Expansion as Pullback",
abstract = "We introduce a new graphical representation for multiplicative and exponential linear logic proof-structures, based only on standard labelled oriented graphs and standard notions of graph theory. The inductive structure of boxes is handled by means of a box-tree. Our proof-structures are canonical and allows for an elegant definition of their Taylor expansion by means of pullbacks.",
keywords = "Graph, Linear logic, Proof-net, Taylor expansion",
author = "Giulio Guerrieri and Luc Pellissier and {Tortora de Falco}, Lorenzo",
year = "2019",
month = "6",
day = "9",
doi = "10.1007/978-3-662-59533-6_18",
language = "English",
isbn = "9783662595329",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "282--300",
editor = "Rosalie Iemhoff and Michael Moortgat and {de Queiroz}, Ruy",
booktitle = "Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings",

}

TY - GEN

T1 - Proof-Net as Graph, Taylor Expansion as Pullback

AU - Guerrieri, Giulio

AU - Pellissier, Luc

AU - Tortora de Falco, Lorenzo

PY - 2019/6/9

Y1 - 2019/6/9

N2 - We introduce a new graphical representation for multiplicative and exponential linear logic proof-structures, based only on standard labelled oriented graphs and standard notions of graph theory. The inductive structure of boxes is handled by means of a box-tree. Our proof-structures are canonical and allows for an elegant definition of their Taylor expansion by means of pullbacks.

AB - We introduce a new graphical representation for multiplicative and exponential linear logic proof-structures, based only on standard labelled oriented graphs and standard notions of graph theory. The inductive structure of boxes is handled by means of a box-tree. Our proof-structures are canonical and allows for an elegant definition of their Taylor expansion by means of pullbacks.

KW - Graph

KW - Linear logic

KW - Proof-net

KW - Taylor expansion

UR - http://www.scopus.com/inward/record.url?scp=85068603235&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-59533-6_18

DO - 10.1007/978-3-662-59533-6_18

M3 - Conference contribution

SN - 9783662595329

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 282

EP - 300

BT - Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings

A2 - Iemhoff, Rosalie

A2 - Moortgat, Michael

A2 - de Queiroz, Ruy

PB - Springer Verlag

CY - Berlin, Germany

ER -