Ulrich Berger

Old slides

• Continuous Semantics for Strong Normalization, invited talk at CiE 2005 , Amsterdam, 11 June, 2005


• Strong normalization for lambda-calculi with recursion, talk at the Dagstuhl Seminar Mathematics, Algorithms, Proofs , 14 January, 2005


• Logical Relations and Complexity in Higher Types (pdf file), talk at the GKLI Springschool, Logic in Computer Science , Venice, 8 April, 2004


• A computational interpretation of classical analysis (pdf file), talk at the conference Calcul formel, algorithms certifie, preuves constructives, CIRM, Luminy, Marseille, 12-16 January, 2004


• Minimisation vs. recursion on the partial continuous functionals, invited talk at the International Symposium Logic and Applications, May 4-6, 2000, Novosibirsk, Russia


• Computability in Transfinite Types, invited talk at the 11th International Congress of Logic Methodology and Philosophy of Science, August 20-26, 1999, Cracow, Poland

• Back to my Homepage
• List of publications
• Recent papers and drafts