Abstract machines for game semantics, revisited

Add to your list(s) Download to your calendar using vCal

• Olle Fredriksson (University of Birmingham)
• Tuesday 05 February 2013, 11:00-12:00
• CS 217.

If you have a question about this talk, please contact Dan Ghica.

We define new abstract machines for game semantics which correspond to networks of conventional computers, and can be used as an intermediate representation for compilation targeting distributed systems. This is achieved in two steps. First we introduce the HRAM , a \emph{Heap and Register Abstract Machine}, an abstraction of a conventional computer, which can be structured into HRAM nets, an abstract point-to-point network model. HRA Ms are multi-threaded and subsume communication by tokens (\emph{cf.} IAM ) or jumps (\emph{cf.} JAM ). Game Abstract Machines (GAM), are HRA Ms with additional structure at the interface level, but no special operational capabilities. We show that GAMs cannot be naively composed, but composition must be mediated using appropriate HRAM combinators. HRA Ms are flexible enough to allow the representation of game models for languages with state (non-innocent games) or concurrency (non-alternating games). We illustrate the potential of this technique by implementing a toy distributed compiler for ICA , a higher-order programming language with shared state concurrency, thus significantly extending our previous distributed PCF compiler. We show that compilation is sound and memory-safe, i.e. no (distributed or local) garbage collection is necessary.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Lab Lunch

Note that ex-directory lists are not shown.