Complexity of computation (including implicit computational complexity), Proof theory in general (including proof-theoretic semantics), polynomial-time computable functions, ramified recursion, Logic, Theory of programming languages, Ramified recursion, Normalisation, higher type recursion, lambda calculus, Higher type recursion, Functionals in proof theory, Recursive functions and relations, subrecursive hierarchies, normalisation, Higher-type and set recursion theory, Polynomial time, Grammars and rewriting systems, Combinatory logic and lambda calculus, Complexity classes (hierarchies, relations among complexity classes, etc.), Second- and higher-order arithmetic and fragments, Lambda calculus