1. Continuous normalization for the lambda-calculus and Gödel’s T;Aehlig;Ann. Pure Appl. Logic,2005
2. Klaus Aehlig, Helmut Schwichtenberg, A syntactical analysis of non-size-increasing polynomial time computation, in: Proceedings of the Fifteenth IEEE Symposium on Logic in Computer Science, LICS’00, 2000, pp. 84–91
3. Exact bounds for lengths of reductions in typed λ-calculus;Beckmann;J. Symbolic Logic,2001
4. Dynamic ordinal analysis;Beckmann;Arch. Math. Logic,2003
5. Generalised dynamic ordinals—universal measures for implicit computational complexity;Beckmann,2006