1. Barendregt, H., The Lambda Calculus, North Holland (1984).
2. Goerdt, A., On the expressive strength of the finitely typed Lambda-Terms, 13th MFCS, LNCS 324 (1988), 329–338.
3. Goerdt,A., Characterizing complexity classes by higher type primitive recursive definitions, to appear.
4. Gurevich, Y., Algebras of feasible functions, 24th FOCS 1983, 210–214.
5. Gurevich, Y., Toward logic taylored for computational complexity, LNM 1104 (1984), 175–216.