1. Barendregt, H., The lambda calculus. North Holland 1984.
2. Goerdt, A., Characterizing complexity classes by higher type primitive recursive definitions, LICS (1989), 364–374.
3. Goerdt, A., Characterizing complexity classes by finitely typed λ-terms, Workshop Computer Science Logic 1988, LNCS, to appear.
4. Gurevich, Y., Algebras of feasible functions, 24th FOCS (1983), 210–214.
5. Gurevich, Y., Toward logic taylored for computational complexity, computation and proof theory, LNM 1104 (1984), 175–216.