Author of the publication

A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables.

, , , and . ICTAC, volume 5160 of Lecture Notes in Computer Science, page 171-185. Springer, (2008)

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.

 

Other publications of authors with the same name

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