An analysis of innocent interaction
Russ Harmer, Universite de Paris 7
Date and time: Friday 29th May 2009 at 14:00
Location: UG40, School of Computer Science
Host: Dan
We will present an analysis of the process of interaction between innocent strategies, leading to a new class of cellular strategies with an associated abstract machine, the CPAM, which radically simplifies the usual machines for innocent interaction (PAM, VAM, GAM, etc). We will then describe a cellularization process, mapping an innocent strategy to a cellular strategy, that allows us to simulate the usual machines by first cellularizing and then using the CPAM. If time permits, we will also explain the connection of this work with the use of a distributive law (!?A -o ?!A) to construct the category of innocent strategies.