default search action
Alexis Saurin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c32]Kostia Chardonnet, Alexis Saurin, Benoît Valiron:
A Curry-Howard Correspondence for Linear, Reversible Computation. CSL 2023: 13:1-13:18 - [c31]Anupam Das, Abhishek De, Alexis Saurin:
Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS 2023: 40:1-40:17 - [c30]Alexis Saurin:
A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points. TABLEAUX 2023: 203-222 - [c29]Aurore Alcolei, Luc Pellissier, Alexis Saurin:
The exponential logic of sequentialization. MFPS 2023 - [i2]Kostia Chardonnet, Alexis Saurin, Benoît Valiron:
A Curry-Howard Correspondence for Linear, Reversible Computation. CoRR abs/2302.11887 (2023) - 2022
- [c28]Anupam Das
, Abhishek De, Alexis Saurin:
Decision Problems for Linear Logic with Least and Greatest Fixed Points. FSCD 2022: 20:1-20:20 - [c27]Abhishek De, Farzad Jafarrahmani, Alexis Saurin:
Phase Semantics for Linear Logic with Least and Greatest Fixed Points. FSTTCS 2022: 35:1-35:23 - [c26]David Baelde
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS 2022: 63:1-63:13 - 2021
- [c25]Abhishek De, Luc Pellissier, Alexis Saurin:
Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. PPDP 2021: 7:1-7:15 - 2020
- [c24]Kostia Chardonnet, Alexis Saurin, Benoît Valiron
Toward a Curry-Howard Equivalence for Linear, Reversible Computation - Work-in-Progress. RC 2020: 144-152 - [i1]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing threads for infinitary and circular proofs. CoRR abs/2005.08257 (2020)
2010 – 2019
- 2019
- [j5]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): 831-880 (2019) - [j4]David Baelde
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): 1007-1008 (2019) - [c23]Abhishek De, Alexis Saurin:
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. TABLEAUX 2019: 297-316 - [c22]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: 317-334 - 2018
- [c21]Rémi Nollet, Alexis Saurin, Christine Tasson
Local Validity for Circular Proofs in Linear Logic with Fixed Points. CSL 2018: 35:1-35:23 - 2016
- [c20]David Baelde
Infinitary Proof Theory: the Multiplicative Additive Case. CSL 2016: 42:1-42:17 - [c19]Pierre-Marie Pédrot, Alexis Saurin:
Classical By-Need. ESOP 2016: 616-643 - [c18]Amina Doumane, David Baelde
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. LICS 2016: 377-386 - 2015
- [c17]David Baelde
Least and Greatest Fixed Points in Ludics. CSL 2015: 549-566 - [c16]Marc Bagnol, Amina Doumane, Alexis Saurin:
On the Dependencies of Logical Rules. FoSSaCS 2015: 436-450 - 2014
- [c15]Marc Bagnol, Amina Doumane, Alexis Saurin:
Analyse de dépendances et correction des réseaux de preuve. JFLA 2014: 159-174 - [c14]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: 175-189 - 2013
- [e1]Ugo de'Liguoro, Alexis Saurin:
Proceedings First Workshop on Control Operators and their Semantics, COS 2013, Eindhoven, The Netherlands, June 24-25, 2013. EPTCS 127, 2013 [contents] - 2012
- [j3]Alexis Saurin:
Böhm theorem and Böhm trees for the λμ-calculus. Theor. Comput. Sci. 435: 106-138 (2012) - [c13]Zena M. Ariola, Paul Downen
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS 2012: 32-46 - 2011
- [c12]Zena M. Ariola, Hugo Herbelin, Alexis Saurin:
Classical Call-by-Need and Duality. TLCA 2011: 27-44 - [p1]Michele Basaldella, Alexis Saurin, Kazushige Terui:
On the Meaning of Focalization. PRELUDE Project 2011: 78-87 - 2010
- [j2]Olivier Delande, Dale Miller
Proof and refutation in MALL as a game. Ann. Pure Appl. Log. 161(5): 654-672 (2010) - [j1]Alexis Saurin:
Typing streams in the Λµ-calculus. ACM Trans. Comput. Log. 11(4): 28:1-28:34 (2010) - [c11]Alexis Saurin:
Standardization and Böhm Trees for Lambdaµ-Calculus. FLOPS 2010: 134-149 - [c10]Alexis Saurin:
A Hierarchy for Delimited Continuations in Call-by-Name. FoSSaCS 2010: 374-388 - [c9]Simona Ronchi Della Rocca, Alexis Saurin, Yiorgos Stavrinos, Anastasia Veneti:
Intersection Logic in sequent calculus style. ITRS 2010: 16-30 - [c8]Michele Basaldella, Alexis Saurin, Kazushige Terui:
From Focalization of Logic to the Logic of Focalization. MFPS 2010: 161-176
2000 – 2009
- 2008
- [c7]Alexis Saurin:
On the Relations between the Syntactic Theories of lambda-mu-Calculi. CSL 2008: 154-168 - [c6]Alexis Saurin:
Towards Ludics Programming: Interactive Proof Search. ICLP 2008: 253-268 - [c5]Kaustuv Chaudhuri, Dale Miller
Canonical Sequent Proofs via Multi-Focusing. IFIP TCS 2008: 383-396 - 2007
- [c4]Dale Miller, Alexis Saurin:
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. CSL 2007: 405-419 - 2005
- [c3]Dale Miller, Alexis Saurin:
A game semantics for proof search: preliminary results. GALOP@ETAPS 2005: 92-106 - [c2]Alexis Saurin:
Separation with Streams in the lambdaµ-calculus. LICS 2005: 356-365 - [c1]Dale Miller
A Game Semantics for Proof Search: Preliminary Results. MFPS 2005: 543-563
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: