A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic. - Damiano Mazza; Luc Pellissier (ICTAC, 2015)

Computing Connected Proof(-Structure)s From Their Taylor Expansion. - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (FSCD, 2016)

Relational type-checking for MELL proof-structures. Part 1: Multiplicatives. - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (CoRR, 2016)

Reductions and linear approximations. (Réductions et approximations linéaires). - Luc Pellissier (2017)

PRAMs over integers do not compute maxflow efficiently. - Luc Pellissier; Thomas Seiller (CoRR, 2018)

Polyadic approximations, fibrations and intersection types. - Damiano Mazza; Luc Pellissier; Pierre Vial (Proc. ACM Program. Lang., 2018)

Proof-Net as Graph, Taylor Expansion as Pullback. - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (WoLLIC, 2019)

Glueability of resource proof-structures: inverting the Taylor expansion (long version). - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (CoRR, 2019)

Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (CSL, 2020)

Inferential Semantics as Argumentative Dialogues. - Davide Catta; Luc Pellissier; Christian Retoré (DCAI (Special Sessions), 2020)

Lower bounds for prams over Z. - Luc Pellissier; Thomas Seiller (CoRR, 2020)

Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. - Abhishek De 001; Luc Pellissier; Alexis Saurin (PPDP, 2021)

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion. - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (Log. Methods Comput. Sci., 2022)

The exponential logic of sequentialization. - Aurore Alcolei; Luc Pellissier; Alexis Saurin (MFPS, 2023)

Unifying lower bounds for algebraic machines, semantically. - Thomas Seiller; Luc Pellissier; Ulysse Léchine (Inf. Comput., 2024)