Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indagationes Mathematicae, vol.34, pp.381-392, 1972. ,
A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1990. ,
DOI : 10.1145/96709.96714
Lambda-calculus, types and models, 1993. ,
URL : https://hal.archives-ouvertes.fr/cel-00574575
Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001. ,
DOI : 10.1007/s001530000057
Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, pp.259-276, 2003. ,
DOI : 10.1016/S0304-3975(02)00776-4
URL : https://hal.archives-ouvertes.fr/hal-00154478
Disjunctive tautologies and synchronisation schemes. Computer Science Logic'00, Lecture Notes in Computer Science no. 1862, pp.292-301, 2000. ,
The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964. ,
DOI : 10.1093/comjnl/6.4.308