On Linear Combinations of lambda -Terms. - Lionel Vaux (RTA, 2007)

Convolution λ̅μ-Calculus. - Lionel Vaux (TLCA, 2007)

The differential lambdamu-calculus. - Lionel Vaux (Theor. Comput. Sci., 2007)

λ-calcul différentiel et logique classique : interactions calculatoires. (Differential λ-calculus and classical logic : their computational interactions). - Lionel Vaux (2007)

Differential Linear Logic and Polarization. - Lionel Vaux (TLCA, 2009)

The algebraic lambda calculus. - Lionel Vaux (Math. Struct. Comput. Sci., 2009)

A non-uniform finitary relational semantics of system T. - Lionel Vaux (RAIRO Theor. Informatics Appl., 2013)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda λ -terms. - Michele Pagani; Christine Tasson; Lionel Vaux (FoSSaCS, 2016)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms. - Michele Pagani; Christine Tasson; Lionel Vaux (CoRR, 2016)

Taylor Expansion, lambda-Reduction and Normalization. - Lionel Vaux (CSL, 2017)

Normalizing the Taylor expansion of non-deterministic λ-terms, via parallel reduction of resource vectors. - Lionel Vaux (CoRR, 2017)

An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets. - Jules Chouquet; Lionel Vaux Auclair (CSL, 2018)

Transport of finiteness structures and applications. - Christine Tasson; Lionel Vaux (Math. Struct. Comput. Sci., 2018)

Normalizing the Taylor expansion of non-deterministic { lambda}-terms, via parallel reduction of resource vectors. - Lionel Vaux (Log. Methods Comput. Sci., 2019)

Sur la syntaxe de la sémantique quantitative. - Lionel Vaux (2021)

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets. - Jules Chouquet; Lionel Vaux Auclair (Log. Methods Comput. Sci., 2021)

Taylor Expansion Finitely Simulates Infinitary β-Reduction. - Rémy Cerda; Lionel Vaux Auclair (CoRR, 2022)

On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants. - Federico Olimpieri; Lionel Vaux Auclair (Log. Methods Comput. Sci., 2022)

Strategies as Resource Terms, and Their Categorical Semantics. - Lison Blondeau-Patissier; Pierre Clairambault; Lionel Vaux Auclair (FSCD, 2023)

The algebraic λ-calculus is a conservative extension of the ordinary λ-calculus. - Axel Kerinec; Lionel Vaux Auclair (CoRR, 2023)

How To Play The Accordion. On the (Non-)Conservativity of the Reduction Induced by the Taylor Approximation of λ-Terms. - Rémy Cerda; Lionel Vaux Auclair (CoRR, 2023)

Extensional Taylor Expansion. - Lison Blondeau-Patissier; Pierre Clairambault; Lionel Vaux Auclair (CoRR, 2023)

Finitary Simulation of Infinitary $ beta$-Reduction via Taylor Expansion, and Applications. - Rémy Cerda; Lionel Vaux Auclair (Log. Methods Comput. Sci., 2023)

Confluence for Proof-Nets via Parallel Cut Elimination. - Giulio Guerrieri; Giulia Manara; Lorenzo Tortora de Falco; Lionel Vaux Auclair (LPAR, 2024)

Yeo's Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic. - Rémi Di Guardia; Olivier Laurent 001; Lorenzo Tortora de Falco; Lionel Vaux Auclair (FSCD, 2025)

How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-Calculus. - Rémy Cerda; Lionel Vaux Auclair (STACS, 2025)