1. The calculi of lambda-conversion;Church,1941
2. Gandy, R.O.: Proofs of strong normalization. In: To H.B. Curry: essays in combinatory logic, lambda calculus and formalism. London 1980
3. Some classes of recursive functions;Grzegorczyk;Rozprawy Mat.,1953
4. The typed λ-calculus is not elementary recursive;Statman;Theor. Computer Science,1979
5. Troelstra, A.S. (editor): Metamathematical investigation of intuitionistic arithmetic and analysis. Springer Lecture Notes in Math. No. 344. Berlin 1973