Alexis Saurin

According to our database, Alexis Saurin authored at least 38 papers between 2005 and 2023.

Collaborative distances:

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

2023

The exponential logic of sequentialization.

Aurore Alcolei, Luc Pellissier, Alexis Saurin

Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points.

Alexis Saurin

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Comparing Infinitary Systems for Linear Logic with Fixed Points.

Anupam Das, Abhishek De, Alexis Saurin

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

A Curry-Howard Correspondence for Linear, Reversible Computation.

Kostia Chardonnet, Alexis Saurin, Benoît Valiron

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs.

David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Phase Semantics for Linear Logic with Least and Greatest Fixed Points.

Abhishek De, Farzad Jafarrahmani, Alexis Saurin

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Decision Problems for Linear Logic with Least and Greatest Fixed Points.

Anupam Das, Abhishek De, Alexis Saurin

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Canonical proof-objects for coinductive programming: infinets with infinitely many cuts.

Abhishek De, Luc Pellissier, Alexis Saurin

Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

2020

Bouncing threads for infinitary and circular proofs.

David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin

CoRR, 2020

Toward a Curry-Howard Equivalence for Linear, Reversible Computation - Work-in-Progress.

Kostia Chardonnet, Alexis Saurin, Benoît Valiron

Proceedings of the Reversible Computation - 12th International Conference, 2020

2019

A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday.

David Baelde, Amy P. Felty, Gopalan Nadathur, Alexis Saurin

Math. Struct. Comput. Sci., 2019

The fixed point property and a technique to harness double fixed point combinators.

Giulio Manzonetto, Andrew Polonsky, Alexis Saurin, Jakob Grue Simonsen

J. Log. Comput., 2019

PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.

Rémi Nollet, Alexis Saurin, Christine Tasson

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory.

Abhishek De, Alexis Saurin

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018

Local Validity for Circular Proofs in Linear Logic with Fixed Points.

Rémi Nollet, Alexis Saurin, Christine Tasson

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

2016

Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions.

Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Classical By-Need.

Pierre-Marie Pédrot, Alexis Saurin

Proceedings of the Programming Languages and Systems, 2016

Infinitary Proof Theory: the Multiplicative Additive Case.

David Baelde, Amina Doumane, Alexis Saurin

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

On the Dependencies of Logical Rules.

Marc Bagnol, Amina Doumane, Alexis Saurin

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

Least and Greatest Fixed Points in Ludics.

David Baelde, Amina Doumane, Alexis Saurin

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Nécessité faite loi : de la réduction linéaire de tête à l'évaluation paresseuse.

Pierre-Marie Pédrot, Amina Doumane, Alexis Saurin

Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Analyse de dépendances et correction des réseaux de preuve.

Marc Bagnol, Amina Doumane, Alexis Saurin

Proceedings of the 25. Journées francophones des langages applicatifs, 2014

2012

Böhm theorem and Böhm trees for the λμ-calculus.

Alexis Saurin

Theor. Comput. Sci., 2012

Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.

Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011

On the Meaning of Focalization.

Michele Basaldella, Alexis Saurin, Kazushige Terui

Proceedings of the Ludics, Dialogue and Interaction - PRELUDE Project, 2011

Classical Call-by-Need and Duality.

Zena M. Ariola, Hugo Herbelin, Alexis Saurin

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

2010

Typing streams in the Λµ-calculus.

Alexis Saurin

ACM Trans. Comput. Log., 2010

From Focalization of Logic to the Logic of Focalization.

Michele Basaldella, Alexis Saurin, Kazushige Terui

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

Intersection Logic in sequent calculus style

Simona Ronchi Della Rocca, Alexis Saurin, Yiorgos Stavrinos, Anastasia Veneti

Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

Proof and refutation in MALL as a game.

Olivier Delande, Dale Miller, Alexis Saurin

Ann. Pure Appl. Log., 2010

A Hierarchy for Delimited Continuations in Call-by-Name.

Alexis Saurin

Proceedings of the Foundations of Software Science and Computational Structures, 2010

Standardization and Böhm Trees for Lambda<i>µ</i>-Calculus.

Alexis Saurin

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2008

Canonical Sequent Proofs via Multi-Focusing.

Kaustuv Chaudhuri, Dale Miller, Alexis Saurin

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Towards Ludics Programming: Interactive Proof Search.

Alexis Saurin

Proceedings of the Logic Programming, 24th International Conference, 2008

On the Relations between the Syntactic Theories of lambda-mu-Calculi.

Alexis Saurin

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.

Dale Miller, Alexis Saurin

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005

A Game Semantics for Proof Search: Preliminary Results.

Dale Miller, Alexis Saurin

Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Separation with Streams in the lambdaµ-calculus.

Alexis Saurin

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005