Full abstraction for PCF

Samson Abramsky

(Imperial College)

The full abstraction problem for PCF is one of the best-known and longest standing problems in the semantics of computation. It concerns the semantic characterization of sequential, functional computation at higher types, and holds (part of) the key to the proper understanding of many important programming mechanisms. This problem has recently been solved by the author and his colleagues, using tools from game semantics and Linear logic. The background and history of the problem, and the key ingredients of the solution, will be described. (This is joint work with Radha Jagadeesan and Pasquale Malacaria.)
Tuesday 7th December 1993, 14:30
Seminar Room 322
Department of Computer Science