1. The Lambda Calculus, its Syntax and Semantics;Barendregt,1984
2. Theoretical pearls: Enumerators of lambda terms are reducing;Barendregt;J. Funct. Programming,1992
3. Theoretical pearls: Representing ‘undefined’ in lambda calculus;Barendregt;J. Funct. Programming,1992
4. Theory of recursive functions and effective computability;Rogers,1967
5. Two recursion theoretic problems in lambda calculus;Statman,1987