![]() |
![]() |
Round abstraction, compositionallyAdd to your list(s) Download to your calendar using vCal
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:Note that ex-directory lists are not shown. |
Other listsSoCS PhD Research Training Sessions Quantitative Methods in Finance Seminar Medical Imaging Research SeminarsOther talksSpectrally selective metasurfaces based on bound states in the continuum: a versatile platform for enhanced light-matter coupling Modelling uncertainty in image analysis. The science of the large scale heliosphere and the missions that made it possible Seminar: TBA Colloquium: TBA Seminar: TBA |