Proof-Net as Graph, Taylor Expansion as Pullback - Archive ouverte HAL Access content directly
Book Sections Year : 2019

Proof-Net as Graph, Taylor Expansion as Pullback


We introduce a new graphical representation for multiplica-tive 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.
Fichier principal
Vignette du fichier
2019 WoLLIC.pdf (689.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02313538 , version 1 (11-10-2019)



Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco. Proof-Net as Graph, Taylor Expansion as Pullback. Logic, Language, Information, and Computation - 26th Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings, pp.282-300, 2019, ⟨10.1007/978-3-662-59533-6_18⟩. ⟨hal-02313538⟩
51 View
138 Download



Gmail Facebook X LinkedIn More