Doing dataflow in PCF

Russ Harmer

We present some of the results of an analysis of the game semantics of PCF due to Hyland & Ong. In particular, we will show how thinking about PCF terms as processes (the view encouraged by game semantics) instead of as functions (the view encouraged by domain theory) leads to a novel interpretation of type depth 3 functionals as describing the structure and execution of simple dataflow networks. No prior knowledge of game semantics will be assumed; all the necessary preliminaries will be explained (so the talk should also serve as an introduction to game semantics).