Realizability: a historical Essay. Mathematical Structures in Computer Science (2002),12,pp.239-263.
Relative and Modified Relative Realizability, with Lars Birkedal.Annals of Pure and Applied Logic 118 (2002),pp.115-132.
Ordered PCA's, with Pieter Hofstra. Mathematical Proceedings of the Cambridge Philosophical Society, 2003,134,pp.445-463.
A Partial Analysis of Modified Realizability. Journal of Symbolic Logic 69 (2004),2,pp.421-429.
Well-foundedness in Realizability. With Martin Hoffman and Thomas Streicher.Archive for Mathematical Logic 45 (2006), 795-805.
A Coinductive Definition of Repletion.Note.
Review of "Sheaves, Games and Model Completions" by S. Ghilardi and M. Zawadowski. Bulletin of Symbolic Logic,10 (2004),2,216-217.
Note on the Independence of Premiss principle.
Filtered Colimits in the Effective Topos. Journal of Pure and Applied Algebra 205 (2006), 446-451.
Algebraic Set Theory and the Effective Topos. With Claire Kouwenhoven. Journal of Symbolic Logic 70 (2005),3, pp.879--890.
A general form of relative recursion, October 2005. Notre Dame Journal of Formal Logic 47 (2006), no.3, 311-318
Review of "From Sets and Types...", July 2006. Bulletin of Symbolic Logic 12 (2006),no.4,611-612
Slides of invited tutorial What is Synthetic Domain Theory?, FMCS 2006, Kananaskis (Canada)
Partial Combinatory Algebras of Functions, May 2009
A Notion of Homotopy for the Effective Topos, March 2010
Back to base.