LFCS Seminar Tuesday 1st July: John Longley

Title: Plotkin's PCF and its sublanguages

Abstract

This talk is the 3rd in a short series of 4 tutorial lectures covering
some classic material from higher-order computability theory. The
lectures cover classic material rather than very recent research.
They contain fundamental ideas that have proved to be of enduring
interest, but are perhaps not so easy to learn from books and papers.
These lectures reflect some of my recent ideas for presenting this
material as I work on the second edition of my book with Dag Normann on the
subject.


Lecture 3 will cover the following material:


The Nested Sequential Procedure (NSP) model. Relationship to game
models.

Submodels embodying various levels of computational power.

Why 'recursion is more powerful than iteration'.