Klaus Aehlig, Habilitation

As part of my habilitation studies I submit the following material for final examination.

• A thesis (pdf) entitled "Parallel Time and Proof Complexity".
• Four publications in Computer Science, not in the area of the thesis.
  • Klaus Aehlig. A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Logical Methods in Computer Science, 3(3:1), 2007.
  • Klaus Aehlig, Arnold Beckmann. On the computational complexity of cut-reduction. In Proceedings of the Twentythird Annual IEEE Symposium on Logic in Computer Science (LICS '08).
  • Klaus Aehlig, Florian Haftmann, Tobias Nipkow. A Compiled Implementation of Normalization by Evaluation. In Proceedings of the Twentyfirst International Conference on Theorem Proving in Higher Order Logics (TPHOLs '08).
  • Klaus Aehlig, Felix Joachimski. Continuous Normalization for the Lambda-Calculus and Gödel's T. Annals of Pure and Applied Logic, 133(1-3) (2005), 39-71.
• A cover letter, containing a German CV, a list of publications and a list of lectures held.

Moreover, a list of publications is available. For most of them, the final drafts are avaiable online (see my homepage and here).