Teaching

I was awarded in 2014 the prizes for both, best supervisor for BSc and best supervisor for MSc projects, in the Faculty of Natural and Mathematical Sciences.

Examiner of PhD-theses:

• Dragisa Zunic (2007, ENS in Lyon)
• Clement Houtmann (2010, INRIA Bordeaux)
• Nikolai Sultana (2014, Cambridge)
• Andrew Boyton (2014, UNSW Australia)
• Amy Furniss (2015, Leicester)
• Julian Hedges (2016, QMUL London)
• Ana Cristina Rocha-Oliveira (2016, University of Brasilia)
• Lorenzo Gheri (2018, Middlesex University London)
• Eleanor Davis (2021, Warwick University)
• Kawin Worrasangasilpa (2021, Cambridge)
• Chelsea Louise Edmonds (2023, Cambridge)
• Gabriel Ferreira Silva (2024, University of Brasilia)

2023-2024

• Compilers and Formal Languages (173 students)
• Practical Experiences of Programming (Scala Part, 5 weeks, 275 students)

2022-2023

• Compilers and Formal Languages (116 students)
• Practical Experiences of Programming (Scala Part, 5 weeks, 396 students)

2021-2022

• Compilers and Formal Languages (93 students)
• Practical Experiences of Programming (Scala Part, 5 weeks, 438 students)

2020-2021

• Compilers and Formal Languages (60 students)
• Practical Experiences of Programming (Scala Part, 5 weeks)

2019-2020

• Compilers and Formal Languages (39 students)
• Practical Experiences of Programming (Scala Part, 5 weeks)

2018-2019

• Compilers and Formal Languages (20 students)
• Practical Experiences of Programming (Scala Part, 5 weeks)

2017-2018

• Compilers and Formal Languages (22 students)
• Security Engineering
• Practical Experiences of Programming (Scala Part, 3 weeks)

2016-2017

• Compilers and Formal Languages
• Security Engineering
• Practical Experiences of Programming (Scala Part, 3 weeks)

2015-2016

• Automata and Formal Languages
• Security Engineering

2014-2015

• Automata and Formal Languages course
• Access Control and Privacy Policies

2013-2014

• Automata and Formal Languages course
• Access Control and Privacy Policies

2012-2013

• Automata and Formal Languages course
• Access Control and Privacy Policies

2011-2012

Autumn

• Course on Access Control and Privacy Policies (at King's; original course by Steve Barker)

Spring

• Help Steffen Zschaler with the Programming Application course; I am responsible for the exercises and the Scala part

2010-2011

Spring

• one-day tutorial on Nominal Isabelle at POPL'11 with Cezary Kaliszyk

Autumn

• Types course at the University of Cambridge (Mondays, Wednesdays and Fridays at 10 o'clock in Lecture Theater 2, starting 8th October) [Lec 1] [Lec 2] [Lec 3] [Lec 4] [Lec 5] [Lec 6] [Lec 7] [Lec 8]
• two-day Isabelle/Isar tutorial at the University Paris Sud with Markus Wenzel

2009-2010

Summer

• a course on Isabelle Programming at the University of Science and Technology in Nanjing (24 hours) [Lec 1] [Lec 2] [Lec 3] [Lec 4] [Lec 5] [Lec 6] [Lec 7] [Lec 8] [Lec 9] [Lec 10] [Lec 11] [Lec 12]

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)

Sommersemester

A course on my nominal work at the LMU (10h) (slides of [Lec 1] [Lec 2] [Lec 3] [Lec 4] [Lec 5] [Lec 6] [Lec 7] [Lec 8] [Lec 9] [Lec 10])

2003-2004

Michealmas

Logic and Proof (4h)

Discrete Mathematics I (9h)

Part II project on a Nominal Theorem Assistant (5.5h)

Interviews of new students (13.5h)

Lent

Computation Theory (3h)

Discrete Mathematics II (8h)

Semantics of Programming Languages (3h)

Part II project on a Nominal Theorem Assistant (9.5h)

Easter

Regular Languages and Finite Automata (6h)

Foundations of Functional Programming (3h)

Complexity Theory

Summer

Avanced course on nominal logic at the ESSLLI summerschool in Nancy
(slides of [Day 1] [Day 2] [Day 3] [Day 4] [Day 5])

student intern from the ENS Cachan

2002-2003

Michealmas

Logic and Proof (5h)

Discrete Mathematics I (7h)

Part II project on Nominal Unification (7h)

Interviews of new students

Lent

Computation Theory (5.5h)

Discrete Mathematics II (8.5h)

Part II project (5h)

Easter

Semantics of Programming Languages (4h)

Regular Languages and Finite Automata (3h)

Part II project (3.5h)

2001-2002

Michealmas

Logic, Computability and Set Theory (for Math students)

Data Structures and Algorithms

Logic and Proof (4h)

Discrete Mathematics I

Interviews of new students

Lent

Discrete Mathematics II

Semantics of Programming Languages

Computation Theory

Probability

Easter

Regular Languages and Finite Automata

Complexity Theory

previous

Types

Denotational Semantics

Communicating Automata and Pi-calculus

Semantics of Programming Languages

Foundations of Functional Programming

Probability

Computation Theory

Complexity Theory

Logic, Computation and Set Theory