Alexis Saurin

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 19

Top Topics

Approximate Value Iteration

Sequent Calculi

Top Venues

Publications

Kostia Chardonnet, Alexis Saurin, Benoît Valiron
A Curry-Howard Correspondence for Linear, Reversible Computation. CoRR (2023)
Aurore Alcolei, Luc Pellissier, Alexis Saurin
The exponential logic of sequentialization. CoRR (2023)
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
A Curry-Howard Correspondence for Linear, Reversible Computation. CSL (2023)
Anupam Das, Abhishek De, Alexis Saurin
Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS (2023)
Alexis Saurin
A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points. TABLEAUX (2023)
Abhishek De, Farzad Jafar-Rahmani, Alexis Saurin
Phase Semantics for Linear Logic with Least and Greatest Fixed Points. FSTTCS (2022)
Anupam Das, Abhishek De, Alexis Saurin
Decision Problems for Linear Logic with Least and Greatest Fixed Points. FSCD (2022)
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS (2022)
Abhishek De, Luc Pellissier, Alexis Saurin
Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. PPDP (2021)
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
Toward a Curry-Howard Equivalence for Linear, Reversible Computation - Work-in-Progress. RC (2020)
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
Bouncing threads for infinitary and circular proofs. CoRR (2020)
Giulio Manzonetto, Andrew Polonsky, Alexis Saurin, Jakob Grue Simonsen
The fixed point property and a technique to harness double fixed point combinators. J. Log. Comput. 29 (5) (2019)
Rémi Nollet, Alexis Saurin, Christine Tasson
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points. TABLEAUX (2019)
David Baelde, Amy P. Felty, Gopalan Nadathur, Alexis Saurin
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday. Math. Struct. Comput. Sci. 29 (8) (2019)
Abhishek De, Alexis Saurin
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. TABLEAUX (2019)
Rémi Nollet, Alexis Saurin, Christine Tasson
Local Validity for Circular Proofs in Linear Logic with Fixed Points. CSL (2018)
Pierre-Marie Pédrot, Alexis Saurin
Classical By-Need. ESOP (2016)
David Baelde, Amina Doumane, Alexis Saurin
Infinitary Proof Theory: the Multiplicative Additive Case. CSL (2016)
Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. LICS (2016)
Marc Bagnol, Amina Doumane, Alexis Saurin
On the Dependencies of Logical Rules. FoSSaCS (2015)
David Baelde, Amina Doumane, Alexis Saurin
Least and Greatest Fixed Points in Ludics. CSL (2015)
Marc Bagnol, Amina Doumane, Alexis Saurin
Analyse de dépendances et correction des réseaux de preuve. JFLA (2014)
Pierre-Marie Pédrot, Amina Doumane, Alexis Saurin
Nécessité faite loi : de la réduction linéaire de tête à l'évaluation paresseuse. JFLA (2014)
Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS (2012)
Alexis Saurin
Böhm theorem and Böhm trees for the λμ-calculus. Theor. Comput. Sci. 435 (2012)
Zena M. Ariola, Hugo Herbelin, Alexis Saurin
Classical Call-by-Need and Duality. TLCA (2011)
Simona Ronchi Della Rocca, Alexis Saurin, Yiorgos Stavrinos, Anastasia Veneti
Intersection Logic in sequent calculus style ITRS (2010)
Alexis Saurin
A Hierarchy for Delimited Continuations in Call-by-Name. FoSSaCS (2010)
Michele Basaldella, Alexis Saurin, Kazushige Terui
From Focalization of Logic to the Logic of Focalization. MFPS (2010)
Alexis Saurin
Typing streams in the Λµ-calculus. ACM Trans. Comput. Log. 11 (4) (2010)
Alexis Saurin
-Calculus. FLOPS (2010)
Olivier Delande, Dale Miller, Alexis Saurin
Proof and refutation in MALL as a game. Ann. Pure Appl. Log. 161 (5) (2010)
Kaustuv Chaudhuri, Dale Miller, Alexis Saurin
Canonical Sequent Proofs via Multi-Focusing. IFIP TCS (2008)
Alexis Saurin
Towards Ludics Programming: Interactive Proof Search. ICLP (2008)
Alexis Saurin
On the Relations between the Syntactic Theories of lambda-mu-Calculi. CSL (2008)
Dale Miller, Alexis Saurin
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. CSL (2007)
Dale Miller, Alexis Saurin
A Game Semantics for Proof Search: Preliminary Results. MFPS (2005)
Alexis Saurin
Separation with Streams in the lambdaµ-calculus. LICS (2005)
Dale Miller, Alexis Saurin
A game semantics for proof search: preliminary results. GALOP@ETAPS (2005)