+Home
+Publications
+Teaching
+Recent Talks
+My Research Group +
+
+ +Handy Information
+People in Logic
+Programming Languages
+Miscellaneous +
+ + +
+
+Teaching
+ +Undergraduate students who have written dissertations under my supervision: +
-
+
- Dominik Wee (2002-2003, King's College, Cambride; now at McKinsey in Munich) +Part-II dissertation: An Implementation of Alpha-Prolog, +A Logic Programming Language with Support for Binding Syntax (out of 84 dissertations, Dominik's +thesis received the Data Connection prize for the highest number of marks awarded in 2003) +
- Lisa White (2003-2004, Corpus, Cambridge) Part-II dissertation: Hal 2004, A Nominal Theorem +Prover +
- Christine Tasson +(2004, ENS Cachan, France; now in the PPS group in Paris) +Induction Principles for Alpha-Equated Lambda-Terms +(the paper coming out of this work was presented at CADE) +
- Mathilde Arnaud +(2007, ENS Cachan, France) Formalization of Generative Unbinding +
2010-2011
+ +Spring +
-
+
- one-day tutorial on Nominal Isabelle at POPL'11 with Cezary Kaliszyk +
Autumn +
+2009-2010
+ +Summer +
+2008-2009
+ +Summer +
-
+
- a course + on Isabelle at the Chinese Academy of Science (7.5 h) +
- Pearls in Computer Science, a course for gifted undergraduate students in Munich (5h) +
Autumn +
-
+
- a course in Princeton on +Isabelle, Binders and SOS +for students and members of the PL group (8h) +
2007-2008
+ +Sommersemester +
-
+
- Semantics of Programming Languages +(28h) +
- a course on Nominal Isabelle at the +Oregon Summer School +on Logic and Theorem Proving in Programming Languages (4h) +[Slides 1] +[Slides 2] +[Slides 3] +[Video 1] +[Video 2] +[Video 3] +
2006-2007
+Wintersemester +
- Types course + at the TU Munich (21h, slides of + [Lec 1] + [Lec 2] + [Lec 3] + [Lec 4] + [Lec 5, + Ho 5] + [Lec 6] + [Lec 7] + [Lec 8] + [Lec 9] + [Lec 10] + [Lec 11]) +
Sommersemester +
- A course at the International School on Rewriting (1.5h)
2005-2006
+Wintersemester +
- Scheme course at the LMU (4h) +
- a course on nominal datatypes at the University of Pennsylvania + (6.5h, slides of + [Lec 1] + [Lec 2] + [Lec 3] + [Lec 4]) +
- Theory-Minicourse on nominal datatypes in Cambridge + (4h, slides of + [Lec 1] + [Lec 2] + [Lec 3] + [Lec 4]) +
- Club2-course on the nominal datatype package at the TU Munich + (5h, slides of + [Lec 1] + [Lec 2] + [Lec 3] + [Lec 4] + [Lec 5]) +
2004-2005
+Wintersemester +
- Scheme course at the LMU (10h)
+
- Linear Algebra for Computer Scientists at the LMU (14h) +
- Discrete Structures for Computer Scientists at the LMU (12h) +
- Linear Algebra for Computer Scientists at the LMU (14h) +
Sommersemester +
+2003-2004
+Michelmas +
- Logic and Proof (4h)
+
- Discrete Mathematics I (9h) +
- Part II project on a Nominal Theorem Assistant (5.5h) +
- Interviews of new students (13.5h) +
- Discrete Mathematics I (9h) +
Lent +
- Computation Theory (3h)
+
- Discrete Mathematics II (8h) +
- Semantics of Programming Languages (3h) +
- Part II project on a Nominal Theorem Assistant (9.5h) +
- Discrete Mathematics II (8h) +
Easter +
- Regular Languages and Finite Automata (6h)
+
- Foundations of Functional Programming (3h) +
- Complexity Theory +
- Foundations of Functional Programming (3h) +
Summer +
+2002-2003
+Michelmas +
- Logic and Proof (5h)
+
- Discrete Mathematics I (7h) +
- Part II project on Nominal Unification (7h) +
- Interviews of new students +
- Discrete Mathematics I (7h) +
Lent +
- Computation Theory (5.5h)
+
- Discrete Mathematics II (8.5h) +
- Part II project (5h) +
- Discrete Mathematics II (8.5h) +
Easter +
- Semantics of Programming Languages (4h)
+
- Regular Languages and Finite Automata (3h) +
- Part II project (3.5h) +
- Regular Languages and Finite Automata (3h) +
2001-2002
+Michelmas +
- Logic, Computability and Set Theory (for Math students)
+
- Data Structures and Algorithms +
- Logic and Proof (4h) +
- Discrete Mathematics I +
- Interviews of new students +
- Data Structures and Algorithms +
Lent +
- Discrete Mathematics II
+
- Semantics of Programming Languages +
- Computation Theory +
- Probablility +
- Semantics of Programming Languages +
Easter +
- Regular Languages and Finite Automata
+
- Complexity Theory +
previous
+-
+
- Types
+
- Denotational Semantics +
- Communicating Atomata and Pi-calculus +
- Semantics of Programming Languages +
- Foundations of Functional Programming +
- Probability +
- Computation Theory +
- Complexity Theory +
- Logic, Computation and Set Theory +
- Denotational Semantics +