BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2021/newsitem/12539/17
 -March-2021-Cool-Logic-Alex-Keizer
DTSTAMP:20210315T141445
SUMMARY:Cool Logic, Alex Keizer
ATTENDEE;ROLE=Speaker:Alex Keizer
DTSTART;TZID=Europe/Amsterdam:20210317T170000
DTEND;TZID=Europe/Amsterdam:20210317T180000
LOCATION:Online (Zoom)
DESCRIPTION:Type systems are a useful tool to prev
 ent programmers from making obvious mistakes, but 
 they are generally quite limited in what they can 
 describe. We've taken a look at a session types, a
  type system aimed at describing communication pro
 tocols, and checking that programs adhere to these
  protocols. Where previous work on session types h
 as treated them as syntactical objects, we find th
 at protocols have a natural notion of state and ch
 aracterize them as coalgebras, i.e., state-based m
 achines. In doing so, we retrieve natural definiti
 ons for type-equivalence, subtyping and duality of
  types as coinductive relations between states. In
  my talk I'll explain what session types are and p
 resent our syntax-free description of protocols as
  states of a coalgebra (without assuming prior kno
 wledge of coalgebras).  Zoom Meeting ID: 878 6558 
 7983 (link: https://uva-live.zoom.us/j/87865587983
 )   
X-ALT-DESC;FMTTYPE=text/html:\n  <p>Type systems a
 re a useful tool to prevent programmers from makin
 g obvious mistakes, but they are generally quite l
 imited in what they can describe. We've taken a lo
 ok at a session types, a type system aimed at desc
 ribing communication protocols, and checking that 
 programs adhere to these protocols. Where previous
  work on session types has treated them as syntact
 ical objects, we find that protocols have a natura
 l notion of state and characterize them as coalgeb
 ras, i.e., state-based machines. In doing so, we r
 etrieve natural definitions for type-equivalence, 
 subtyping and duality of types as coinductive rela
 tions between states. In my talk I'll explain what
  session types are and present our syntax-free des
 cription of protocols as states of a coalgebra (wi
 thout assuming prior knowledge of coalgebras).</p>
 \n\n  <p>Zoom Meeting ID: 878 6558 7983 (link: <a 
 href="https://uva-live.zoom.us/j/87865587983" targ
 et="_blank">https://uva-live.zoom.us/j/87865587983
 </a>)</p>\n\n  <p>&nbsp;</p>\n
URL:http://events.illc.uva.nl/coollogic/talks/116
CONTACT:Cool Logic at coollogic.amsterdam at gmail
 .com
END:VEVENT
END:VCALENDAR