( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Realisability Semantics for Intersection Types with Expansion Variables.

, , , и . Fundam. Informaticae, 121 (1-4): 153-184 (2012)

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.

Vincent Herrmann

Vincent Fochtman

Vincent Feyen

Vincent Wroblewsky

Vincent Saderne

 

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

A Generic Approach to Proofs about Substitution., и . LFMTP, стр. 5: 1-5: 8. ACM, (2014)A Verified Theorem Prover Backend Supported by a Monotonic Library., , и . LPAR, том 57 из EPiC Series in Computing, стр. 564-582. EasyChair, (2018)Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction., и . LSFA, том 247 из Electronic Notes in Theoretical Computer Science, стр. 85-101. Elsevier, (2008)Computability Beyond Church-Turing via Choice Sequences., , , и . LICS, стр. 245-254. ACM, (2018)A nominal exploration of intuitionism., и . CPP, стр. 130-141. ACM, (2016)On Realisability Semantics for Intersection Types with Expansion Variables., , , и . Fundam. Informaticae, 121 (1-4): 153-184 (2012)Bar Induction is Compatible with Constructive Type Theory., , , и . J. ACM, 66 (2): 13:1-13:35 (2019)PISTIS: From a Word-of-Mouth to a Gentleman's Agreement., , , и . CoRR, (2020)Inductive Continuity via Brouwer Trees., , , и . MFCS, том 272 из LIPIcs, стр. 37:1-37:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables., , , и . ICTAC, том 5160 из Lecture Notes in Computer Science, стр. 171-185. Springer, (2008)