A BRICS Mini-Course
June 7 and 9, 2000
Luigi Santocanale, email@example.com
Interaction and communication can be modeled using games. By finding rigorous mathematical structures to games we provide mathematical structure to interaction and communication as they also occur in concurrent computation. In this way, we can decide to design programming languages guided by those mathematical intuitions; we can analyze existing concepts and problems of concurrent computation in terms of games or even translate entire programs into the language of games as strategies. However all of that would be useless if at the same time we were not supported by a strong mathematical theory about games.
The mini-course will consist of two lectures of 2 x 45=91 minutes each.
On demand, I'll continue during another lecture developing the mathematical theory of the mu-lattice J(X). For example, I'd like also to explain the problems encountered in the proof of freeness of J(X) and their relations to logical ideas. To prove freeness of J(X) we are forced to admit that circular proofs are sometime good proofs, much better proofs than the usual ones.