1. Full Abstraction for PCF
2. Henk Barendregt.The lambda calculus, its syntax and semantics. Number 103 in Studies in Logic and the Foundations of Mathematics. North-Holland, second edition, 1984.
3. Emmanuel Beffara. Realizability with constants. Technical Report oai:hal.archives-ouvertes.fr:hal-00003724\v1, Laboratoire Preuves, Programmes et Systèmes, May 2004. International Workshop on Formal Methods and Security.
4. A semantics of evidence for classical arithmetic
5. Characterization of normal forms possessing inverse in the λ-β-η-calculus