DAT350

Types for Programs and Proofs

[Note: The password to edit this page is proglog.]


SCHEDULE

Each presentation should last 15 minutes. If you work in pairs you should divide the time evenly between yourselves. The goal is to be comprehensible to your fellow students. It is better to focus on some simple points and basic ideas, and present them in an understandable way, rather than try to cover everything in the chapter or article. It is also important to stick to your allotted time slot. After your talk there will be an opportunity to ask questions, first from your opponents, and then from other students.

Please send your slides to Peter.

MONDAY 14 OCTOBER

THURSDAY 17 OCTOBER

MONDAY 21 OCTOBER

TALK PROPOSALS

Topics for the final presentation should be booked here on Friday the 20 September at the latest. You should work in pairs, unless having asked for an exception to work alone. Write your names after the chapter or paper you want to present or be opponents for. The available dates are (MONDAY 14 OCTOBER, THURSDAY 17 OCTOBER and MONDAY 21 OCTOBER). Please let us know if you cannot make it on any of those days, and we will take that into account when scheduling. Presentations of chapters in the book will be scheduled early.

It is first come first serve; you may not choose a topic already chosen by others. You may also propose a research paper not in the list, but then you should discuss this with Peter or Thierry. Yet another alternative is to do an Agda project and present it. Write the project theme below.

Agda project themes

Or you can present a chapter from Pierce:

  • References (Chapter 13) [talk: Patrick Wadström]
  • Exceptions (Chapter 14) [talk: Jonathan Krän & Molly Skelbye]
  • Subtyping (Chapter 15)
  • Imperative objects (Chapter 18, depends on 13, 15)
  • Featherweight Java (Chapter 19, depends on 15)
  • Recursive types (Chapter 20) [talk: Therese Andersson]

Or you can present a classical research paper:

Some more difficult but important papers are:

  • Jean-Louis Krivine, Call-by-name lambda-calculus machine Higher Order and Symbolic Computation 20, p.199-207 (2007) (difficult!) [talk: Karl Lennartsson & Riccardo Zanetti]
  • John Reynolds, Types, abstraction, and parametric polymorphism (difficult!)
  • John Reynolds, Towards a theory of type structure (difficult!)

Security types (these papers are also quite difficult)

You can also choose a paper from Benjamin Pierce's list of great papers on programming languages

  • Peter J. Landin. The next 700 programming languages.

Yet another possibility is to present another dependently typed language, for example

  • Coq
  • Idris
  • Liquid Haskell

or proof assistant

  • Isabelle
  • Hol

or an article in the Stanford Encyclopedia of Philosophy

or homotopy type theory:

  • Homotopy type theory [talk: David Lidell & Francesco Gazzetta]