From post

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ -terms.

, , и . FoSSaCS, том 9634 из Lecture Notes in Computer Science, стр. 408-423. Springer, (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.

 

Другие публикации лиц с тем же именем

The Inverse Taylor Expansion Problem in Linear Logic., и . LICS, стр. 222-231. IEEE Computer Society, (2009)From Geometric Semantics to Asynchronous Computability., , и . DISC, том 9363 из Lecture Notes in Computer Science, стр. 436-451. Springer, (2015)Nominal Techniques in Isabelle/HOL., и . CADE, том 3632 из Lecture Notes in Computer Science, стр. 38-53. Springer, (2005)An Explicit Formula for the Free Exponential Modality of Linear Logic., , и . ICALP (2), том 5556 из Lecture Notes in Computer Science, стр. 247-260. Springer, (2009)PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points., , и . TABLEAUX, том 11714 из Lecture Notes in Computer Science, стр. 317-334. Springer, (2019)Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ -terms., , и . FoSSaCS, том 9634 из Lecture Notes in Computer Science, стр. 408-423. Springer, (2016)The Free Exponential Modality of Probabilistic Coherence Spaces., , , и . FoSSaCS, том 10203 из Lecture Notes in Computer Science, стр. 20-35. (2017)Quantitative Semantics for Probabilistic Programming (Invited Talk).. FSCD, том 84 из LIPIcs, стр. 4:1-4:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)SéMantiques et Syntaxes vectorielles de la logique LinéAIRE. (Vectorial Semantics and Syntax of Linear Logic).. Paris Diderot University, France, (2009)Algebraic Totality, towards Completeness.. TLCA, том 5608 из Lecture Notes in Computer Science, стр. 325-340. Springer, (2009)