Paris ACTS has been created to reinforce the links between different research groups in the Paris area which are working on the connections between automata theory and concurrency theory, and in order to advance this research on a national and international level,
The seminar takes place for an afternoon every six-eight weeks, moving between LIX (École Polytechnique), LRE (EPITA Paris), and IRIF (Université Paris Cité). It is held in hybrid mode and is an evolution of the (i)Po(m)set Project Online Seminar (PPOS). It is inspired by the MeFoSyLoMa seminar, with which it has a slight thematic overlap, but includes a hybrid component.
The seminar has a low-traffic mailing list for announcements etc. If you want to join, send an email to p-acts-owner@ml.lre.epita.fr.
The general program for each afternoon is as follows:
| 14:00--14:45 | In-person talk |
| 14:45--15:30 | Virtual talk |
| 15:30--16:00 | Coffee break |
| 16:00--17:00 | Discussion |
Venue: IRIF, Université Paris Cité
Speaker 1: (present) Laetitia Laversa, IRIF, Université Paris Cité, France
Title: TBA
Speaker 2: (present) Glynn Winskel, Queen Mary University of London, UK
Title: From Concurrent Games to Gödel's Dialectica Interpretation
Abstract: Computation today is highly distributed and interactive. Event structures represent computation in terms of causal dependency and conflict relations on events; the relations make precise the sense in which events can occur concurrently (independently, in parallel). By redeveloping games in sufficient generality, as event structures, interactive computation becomes a strategy and its type a game. Then the dichotomy between a system and its environment is caught in the distinction between Player and Opponent moves. A functional approach has to handle the dichotomy much more ingeniously, through its blunter distinction between input and output. This has led to a variety of functional approaches, specialised to particular interactive demands. A surprise in the development of concurrent games has been that several, seemingly disparate, historical approaches in logic and computation reappear as special cases. They include stable domain theory; nondeterministic dataflow; geometry of interaction; the dialectica interpretation; lenses and optics; and their extensions to containers in dependent lenses and optics.
The organisers can be reached at p-acts-owner@ml.lre.epita.fr.