( en | de | ru )

 

Disambiguation of "Pellissier, Luc"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Connected Proof(-Structure)s From Their Taylor Expansion.

, , and . FSCD, volume 52 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Muriel Pellissier

Luc Segoufin

Luc Turmes

Luc Seysoux

Luc Buatois

 

Other publications of authors with the same name

PRAMs over integers do not compute maxflow efficiently., and . CoRR, (2018)Inferential Semantics as Argumentative Dialogues., , and . DCAI (Special Sessions), volume 1242 of Advances in Intelligent Systems and Computing, page 72-81. Springer, (2020)Computing Connected Proof(-Structure)s From Their Taylor Expansion., , and . FSCD, volume 52 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Reductions and linear approximations. (Réductions et approximations linéaires).. Sorbonne Paris Cité, France, (2017)Glueability of Resource Proof-Structures: Inverting the Taylor Expansion., , and . CSL, volume 152 of LIPIcs, page 24:1-24:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Proof-Net as Graph, Taylor Expansion as Pullback., , and . WoLLIC, volume 11541 of Lecture Notes in Computer Science, page 282-300. Springer, (2019)The exponential logic of sequentialization., , and . MFPS, volume 3 of EPTICS, EpiSciences, (2023)A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic., and . ICTAC, volume 9399 of Lecture Notes in Computer Science, page 144-161. Springer, (2015)Canonical proof-objects for coinductive programming: infinets with infinitely many cuts., , and . PPDP, page 7:1-7:15. ACM, (2021)