Alexis Saurin

Available identifiers

zbMath Open saurin.alexisMaRDI QIDQ428893

List of research outcomes

Publication	Date of Publication	Type
Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs	2024-12-06	Paper
A curry-Howard correspondence for linear, reversible computation	2024-09-25	Paper
Phase semantics for linear logic with least and greatest fixed points	2024-09-12	Paper
Decision problems for linear logic with least and greatest fixed points	2024-05-27	Paper
A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points	2024-05-17	Paper
Local validity for circular proofs in linear logic with fixed points	2022-05-28	Paper
Toward a curry-Howard equivalence for linear, reversible computation. Work-in-progress	2021-07-05	Paper
Intersection logic in sequent calculus style	2021-03-03	Paper
PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points	2020-05-14	Paper
Infinets: the parallel syntax for non-wellfounded proof-theory	2020-05-14	Paper
The fixed point property and a technique to harness double fixed point combinators	2020-02-03	Paper
Towards completeness via proof search in the linear time \(\mu\)-calculus: the case of Büchi inclusions	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q5351980	2017-08-31	Paper
Infinitary proof theory: the multiplicative additive case	2017-07-19	Paper
From focalization of logic to the logic of focalization	2016-07-08	Paper
Classical by-need	2016-04-26	Paper
On the dependencies of logical rules	2015-10-01	Paper
Typing streams in the \({\Lambda}{\mu}\)-calculus	2015-09-17	Paper
A game semantics for proof search (preliminary results)	2013-10-08	Paper
Classical call-by-need sequent calculi: the unity of semantic artifacts	2012-07-20	Paper
Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus	2012-06-25	Paper
Proof and refutation in MALL as a game	2011-08-26	Paper
Classical call-by-need and duality	2011-06-17	Paper
On the meaning of focalization	2011-03-04	Paper
Standardization and Böhm trees for \(\Lambda \mu \)-calculus	2010-05-04	Paper
A hierarchy for delimited continuations in call-by-name	2010-04-27	Paper
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic	2009-03-05	Paper
Towards Ludics Programming: Interactive Proof Search	2009-01-22	Paper
On the Relations between the Syntactic Theories of λμ-Calculi	2008-11-20	Paper

Research outcomes over time

This page was built for person: Alexis Saurin