Skip to main content

Peter Dybjer: Game Semantics and Normalization by Evaluation

Time: Wed 2014-11-05 10.00 - 11.45

Location: Room 16, building 5, Kräftriket, Department of mathematics, Stockholm university

Participating: Peter Dybjer, Chalmers/Gothenburg University

Export to calendar

We show that Hyland and Ong's game semantics for PCF can be presented using normalization by evaluation (nbe). We use the bijective correspondence between innocent well-bracketed strategies and PCF Böhm trees, and show how operations on PCF Böhm trees, such as composition, can be computed lazily and simply by nbe. The usual equations characteristic of games follow from the nbe construction without reference to the game-theoretic machinery. As an illustration, we give a Haskell program computing the application of innocent strategies. This is joint work with Pierre Clairambault, CNRS and ENS Lyon.