( en | de | ru )

 

Disambiguation of "Saurin, Alexis"

Author of the publication

copydeleteadd this publication to your clipboard
Toward a Curry-Howard Equivalence for Linear, Reversible Computation - Work-in-Progress.

, , and . RC, volume 12227 of Lecture Notes in Computer Science, page 144-152. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexis Rozenknop

Alexis Hoen

Alexis Lebedeff

Alexis Rump

Alexis Gette

 

Other publications of authors with the same name

A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points.. TABLEAUX, volume 14278 of Lecture Notes in Computer Science, page 203-222. Springer, (2023)From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic., and . CSL, volume 4646 of Lecture Notes in Computer Science, page 405-419. Springer, (2007)The exponential logic of sequentialization., , and . MFPS, volume 3 of EPTICS, EpiSciences, (2023)A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday., , , and . Math. Struct. Comput. Sci., 29 (8): 1007-1008 (2019)Canonical Sequent Proofs via Multi-Focusing., , and . IFIP TCS, volume 273 of IFIP, page 383-396. Springer, (2008)Phase Semantics for Linear Logic with Least and Greatest Fixed Points., , and . FSTTCS, volume 250 of LIPIcs, page 35:1-35:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Standardization and Böhm Trees for Lambdaµ-Calculus.. FLOPS, volume 6009 of Lecture Notes in Computer Science, page 134-149. Springer, (2010)On the Relations between the Syntactic Theories of lambda-mu-Calculi.. CSL, volume 5213 of Lecture Notes in Computer Science, page 154-168. Springer, (2008)Böhm theorem and Böhm trees for the λμ-calculus.. Theor. Comput. Sci., (2012)A Hierarchy for Delimited Continuations in Call-by-Name.. FoSSaCS, volume 6014 of Lecture Notes in Computer Science, page 374-388. Springer, (2010)