1. Computable Structures and the Hyperarithmetical Hierarchy;Ash,2000
2. The Lambda Calculus, Its Syntax and Semantics;Barendregt,1984
3. S. Berardi, Classical logic as limit completion I&II, Torino University, 2001, manuscript.
4. On the computational content of the axiom of choice;Berardi;J. Symbolic Logic,1998
5. Infinite lambda-calculus and types;Berarducci;Theoret. Comput. Sci.,1999