( en | de | ru )

 

Disambiguation of "Saurin, Alexis"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 Lebedeff

Alexis Rozenknop

Alexis Hoen

Alexis Rump

Alexis Hofmeister

 

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)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)The exponential logic of sequentialization., , and . MFPS, volume 3 of EPTICS, EpiSciences, (2023)Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory., and . TABLEAUX, volume 11714 of Lecture Notes in Computer Science, page 297-316. Springer, (2019)Local Validity for Circular Proofs in Linear Logic with Fixed Points., , and . CSL, volume 119 of LIPIcs, page 35:1-35:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Decision Problems for Linear Logic with Least and Greatest Fixed Points., , and . FSCD, volume 228 of LIPIcs, page 20:1-20:20. 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)