Myra VanInwegen's Supervision Material

I specialize in the more theoretical/mathematical courses for Part IB students. I supervise the following courses:

• Michaelmas: Data Structures & Algorithms, Logic & Proof. I also give the ML Help sessions
• Lent: Computation Theory, Semantics, Prolog. I'm also doing some examples classes for Specification & Verification I.
• Easter: Foundations of Functional Programming, Complexity. I'm also doing some examples classes for Specification & Verification II.

I've made some handout for my students. The ones below are the most useful. There are some more, but they are still in handwritten state.

• Basics of the Theory of Computation. This handout covers a decent portion of the course material for computation theory. They are meant to accompany the official Computation theory notes, highlighting what I feel are the most important aspects of the course, and providing additional motivation and explanation. It should help you obtain a better intuitive understanding of what's happening in the course.
• How To Do Proofs. Are you a bit unsure of what to do when you must "Show that for all..."? This handout explains the basic proof techniques. It gives examples from a variety of Part IB courses. It will give you a good idea of where to start when you have to prove (or "show") something. It also explains what the sequent calculus rules are all about, using the intuition of how to do proofs.
• Structural Induction and Primitive Recursion. This handout follows up on the previous one, giving more details about how to do structural induction (like induction over natural numbers and lists). This ties in with Operational Semantics, since a big part of the course is how to do proofs by induction.
• Three Forms of Operational Semantics for LC. This handout will, I hope, help you to understand the similarities and differences between the three different forms of semantics presented in the Operational Semantics course.