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

The exponential logic of sequentialization - Aurore Alcolei; Luc Pellissier; Alexis Saurin (Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, MFPS XXXIX, Indiana University, Bloomington, IN, USA, June 21-23, 2023, 2023)

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

Canonical proof-objects for coinductive programming: infinets with infinitely many cuts - Abhishek De; Luc Pellissier; Alexis Saurin (PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, Tallinn, Estonia, September 6-8, 2021, 2021)

Glueability of Resource Proof-Structures: Inverting the Taylor Expansion - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain, 2020)

Inferential Semantics as Argumentative Dialogues - Davide Catta; Luc Pellissier; Christian Retoré (Distributed Computing and Artificial Intelligence, Special Sessions, 17th International Conference, DCAI 2020, L'Aquila, Italy, 17-19 June 2020, 2020)

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

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (CoRR, 2020)

Proof-Net as Graph, Taylor Expansion as Pullback - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings, 2019)

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

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

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

Reductions and linear approximations. (Réductions et approximations linéaires) - Luc Pellissier (Sorbonne Paris Cité, France, 2017)

Computing Connected Proof(-Structure)s From Their Taylor Expansion - Giulio Guerrieri; Luc Pellissier; Lorenzo Tortora de Falco (1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal, 2016)

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

A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic - Damiano Mazza; Luc Pellissier (Theoretical Aspects of Computing - ICTAC 2015 - 12th International Colloquium Cali, Colombia, October 29-31, 2015, Proceedings, 2015)