Alexis Saurin

53 papers A* 4A 1B 20C 2Misc 2Journal 13Unranked 8
YearRankTypeTitle / Venue / Authors
2026 B conf
A Uniform Cut-Elimination Theorem for Linear Logics with Fixed Points and Super Exponentials.
CSL
Alexis Saurin, Esaïe Bauer
2026 J jnl
Bidirectional Interpolation for the Lambda-Calculus - Revisiting and Formalising Craig-Čubrić Interpolation.
CoRR
Meven Lennon-Bertrand, Alexis Saurin
2025 J jnl
A Curry-Howard Correspondence for Linear, Reversible Computation.
Log. Methods Comput. Sci.
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
2025 J jnl
A uniform cut-elimination theorem for linear logics with fixed points and super exponentials.
CoRR
Esaïe Bauer, Alexis Saurin
2025 J jnl
Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs.
CoRR
Rémy Cerda, Alexis Saurin
2025 B conf
Interpolation as Cut-Introduction: On the Computational Content of Craig-Lyndon Interpolation.
FSCD
Alexis Saurin
2025 B conf
Ohana Trees and Taylor Expansion for the λI-Calculus: No variable gets left behind or forgotten!
FSCD
Rémy Cerda, Giulio Manzonetto, Alexis Saurin
2025 J jnl
Ohana trees and Taylor expansion for the λI-calculus. No variable gets left behind or forgotten!
CoRR
Rémy Cerda, Giulio Manzonetto, Alexis Saurin
2025 B conf
On the cut-elimination of the modal μ-calculus: Linear Logic to the rescue.
FoSSaCS
Esaïe Bauer, Alexis Saurin
2025 J jnl
On the cut-elimination of the modal μ-calculus: Linear Logic to the rescue.
CoRR
Esaïe Bauer, Alexis Saurin
2025 A* conf
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points.
LICS
Thomas Ehrhard, Farzad Jafarrahmani, Alexis Saurin
2025 — ed.
Proceedings Twelfth Workshop on Fixed Points in Computer Science, FICS@CSL 2024, Naples, Italy, 19-20th February 2024.
FICS@CSL
Alexis Saurin
2023 B conf
A Curry-Howard Correspondence for Linear, Reversible Computation.
CSL
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
2023 J jnl
A Curry-Howard Correspondence for Linear, Reversible Computation.
CoRR
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
2023 B conf
A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points.
TABLEAUX
Alexis Saurin
2023 — conf
Comparing Infinitary Systems for Linear Logic with Fixed Points.
FSTTCS
Anupam Das, Abhishek De, Alexis Saurin
2023 B conf
The exponential logic of sequentialization.
MFPS
Aurore Alcolei, Luc Pellissier, Alexis Saurin
2022 A* conf
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs.
LICS
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2022 B conf
Decision Problems for Linear Logic with Least and Greatest Fixed Points.
FSCD
Anupam Das, Abhishek De, Alexis Saurin
2022 — conf
Phase Semantics for Linear Logic with Least and Greatest Fixed Points.
FSTTCS
Abhishek De, Farzad Jafarrahmani, Alexis Saurin
2021 C conf
Canonical proof-objects for coinductive programming: infinets with infinitely many cuts.
PPDP
Abhishek De, Luc Pellissier, Alexis Saurin
2020 J jnl
Bouncing threads for infinitary and circular proofs.
CoRR
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2020 C conf
Toward a Curry-Howard Equivalence for Linear, Reversible Computation - Work-in-Progress.
RC
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
2019 J jnl
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday.
Math. Struct. Comput. Sci.
David Baelde, Amy P. Felty, Gopalan Nadathur, Alexis Saurin
2019 B conf
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory.
TABLEAUX
Abhishek De, Alexis Saurin
2019 B conf
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
TABLEAUX
Rémi Nollet, Alexis Saurin, Christine Tasson
2019 J jnl
The fixed point property and a technique to harness double fixed point combinators.
J. Log. Comput.
Giulio Manzonetto, Andrew Polonsky, Alexis Saurin, Jakob Grue Simonsen
2018 B conf
Local Validity for Circular Proofs in Linear Logic with Fixed Points.
CSL
Rémi Nollet, Alexis Saurin, Christine Tasson
2016 A conf
Classical By-Need.
ESOP
Pierre-Marie Pédrot, Alexis Saurin
2016 B conf
Infinitary Proof Theory: the Multiplicative Additive Case.
CSL
David Baelde, Amina Doumane, Alexis Saurin
2016 A* conf
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions.
LICS
Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin
2015 B conf
Least and Greatest Fixed Points in Ludics.
CSL
David Baelde, Amina Doumane, Alexis Saurin
2015 B conf
On the Dependencies of Logical Rules.
FoSSaCS
Marc Bagnol, Amina Doumane, Alexis Saurin
2014 — conf
Analyse de dépendances et correction des réseaux de preuve.
JFLA
Marc Bagnol, Amina Doumane, Alexis Saurin
2014 — conf
Nécessité faite loi : de la réduction linéaire de tête à l'évaluation paresseuse.
JFLA
Pierre-Marie Pédrot, Amina Doumane, Alexis Saurin
2013 — ed.
Proceedings First Workshop on Control Operators and their Semantics, COS 2013, Eindhoven, The Netherlands, June 24-25, 2013.
COS
Ugo de'Liguoro, Alexis Saurin
2012 J jnl
Böhm theorem and Böhm trees for the λμ-calculus.
Theor. Comput. Sci.
Alexis Saurin
2012 Misc conf
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.
FLOPS
Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin
2011 — conf
Classical Call-by-Need and Duality.
TLCA
Zena M. Ariola, Hugo Herbelin, Alexis Saurin
2011 — ch.
On the Meaning of Focalization.
PRELUDE Project
Michele Basaldella, Alexis Saurin, Kazushige Terui
2010 B conf
A Hierarchy for Delimited Continuations in Call-by-Name.
FoSSaCS
Alexis Saurin
2010 B conf
From Focalization of Logic to the Logic of Focalization.
MFPS
Michele Basaldella, Alexis Saurin, Kazushige Terui
2010 — conf
Intersection Logic in sequent calculus style
ITRS
Simona Ronchi Della Rocca, Alexis Saurin, Yiorgos Stavrinos, Anastasia Veneti
2010 J jnl
Proof and refutation in MALL as a game.
Ann. Pure Appl. Log.
Olivier Delande, Dale Miller, Alexis Saurin
2010 Misc conf
Standardization and Böhm Trees for Lambda
FLOPS
Alexis Saurin
2010 J jnl
Typing streams in the Λµ-calculus.
ACM Trans. Comput. Log.
Alexis Saurin
2008 — conf
Canonical Sequent Proofs via Multi-Focusing.
IFIP TCS
Kaustuv Chaudhuri, Dale Miller, Alexis Saurin
2008 B conf
On the Relations between the Syntactic Theories of lambda-mu-Calculi.
CSL
Alexis Saurin
2008 B conf
Towards Ludics Programming: Interactive Proof Search.
ICLP
Alexis Saurin
2007 B conf
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.
CSL
Dale Miller, Alexis Saurin
2005 B conf
A Game Semantics for Proof Search: Preliminary Results.
MFPS
Dale Miller, Alexis Saurin
2005 — conf
A game semantics for proof search: preliminary results.
GALOP@ETAPS
Dale Miller, Alexis Saurin
2005 A* conf
Separation with Streams in the lambdaµ-calculus.
LICS
Alexis Saurin