Lionel Vaux Auclair

According to our database, Lionel Vaux Auclair authored at least 24 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2024

Confluence for Proof-Nets via Parallel Cut Elimination.

Giulio Guerrieri, Giulia Manara, Lorenzo Tortora de Falco, Lionel Vaux Auclair

Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

2023

Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications.

Rémy Cerda, Lionel Vaux Auclair

Log. Methods Comput. Sci., 2023

Extensional Taylor Expansion.

Lison Blondeau-Patissier, Pierre Clairambault, 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

The algebraic λ-calculus is a conservative extension of the ordinary λ-calculus.

Axel Kerinec, Lionel Vaux Auclair

CoRR, 2023

Strategies as Resource Terms, and Their Categorical Semantics.

Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

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

Taylor Expansion Finitely Simulates Infinitary β-Reduction.

Rémy Cerda, Lionel Vaux Auclair

CoRR, 2022

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

Sur la syntaxe de la sémantique quantitative.

Lionel Vaux

, 2021

2019

Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors.

Lionel Vaux

Log. Methods Comput. Sci., 2019

2018

Transport of finiteness structures and applications.

Christine Tasson, Lionel Vaux

Math. Struct. Comput. Sci., 2018

An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets.

Jules Chouquet, Lionel Vaux Auclair

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Normalizing the Taylor expansion of non-deterministic λ-terms, via parallel reduction of resource vectors.

Lionel Vaux

CoRR, 2017

Taylor Expansion, lambda-Reduction and Normalization.

Lionel Vaux

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms.

Michele Pagani, Christine Tasson, Lionel Vaux

CoRR, 2016

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms.

Michele Pagani, Christine Tasson, Lionel Vaux

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2013

A non-uniform finitary relational semantics of system T.

Lionel Vaux

RAIRO Theor. Informatics Appl., 2013

2009

The algebraic lambda calculus.

Lionel Vaux

Math. Struct. Comput. Sci., 2009

Differential Linear Logic and Polarization.

Lionel Vaux

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2007

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

Lionel Vaux

PhD thesis, 2007

The differential lambdamu-calculus.

Lionel Vaux

Theor. Comput. Sci., 2007

Convolution λ̅μ-Calculus.

Lionel Vaux

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

On Linear Combinations of <i>lambda</i> -Terms.

Lionel Vaux

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007