Round abstraction, compositionally

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

• Mohamed Nabih Menaa
• Tuesday 17 November 2009, 13:00-14:00
• CS 124.

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

(Work in progress)

We revisit a form of temporal scaling called “round abstraction” as a solution to the problem of building synchronous representations of asynchronous behaviour. We will show how round abstraction can be formalised in a setting akin to the category of games in game semantics (albeit with less restrictions). In particular, we establish a soundness result under certain conditions.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 124
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar

Note that ex-directory lists are not shown.