University of Birmingham > Talks@bham > Theoretical computer science seminar > A bridge between semirings

A bridge between semirings

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

  • UserFlavien Breuvart, PPS, University of Paris 7
  • ClockFriday 21 March 2014, 16:00-17:00
  • HouseUG06 Learning Centre.

If you have a question about this talk, please contact Paul Levy.

The last 25 years have seen many typed languages that, like Bounded Linear Logic (Girard 1987), use a nontrivial decomposition of the linear logic exponential in order to impose or exhibit warranties on used resources. More recently, two articles (Ghica and Smith 2013, Brunel Gaboardi Mazza Zdancewic 2013) generalised this construction (firstly only non-dependent ones) by using an ordered semiring to design this typing system. The goal of this talk will be to study semantics (both categorical and concrete) of this language and the significance of these semirings.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.