BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T112230Z
UID:58a2dd0185f1e313607236@ist.ac.at
DTSTART:20170412T170000
DTEND:20170412T180000
DESCRIPTION:Speaker: Radu Grigore\nhosted by Tom Henzinger\nAbstract: Altho
 ugh not the most popular feature of Java's generics\,\n  bounded wildcards
  have their uses.\nOn the negative side\, bounded wildcards render type ch
 ecking undecidable.\nOn the positive side\, bounded wildcards let us encod
 e any computation at compile time\;\n  so\, Java's type checker can recogn
 ize any recursive language.\n\nThe first part of the talk will review how 
 bounded wildcards\n  are used in the implementation of Java's standard lib
 rary.\nThe second part of the talk will review the proof that bounded wild
 cards\n  render subtype checking undecidable.\n\nBio:\nRadu Grigore is\n  
 a lecturer at University of Kent\n  and an anagram of Argued Rigor.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:pnovotny@ist.ac.at
SUMMARY:Radu Grigore: Java Generics are Turing Complete
URL:https://talks-calendar.ista.ac.at/events/408
END:VEVENT
END:VCALENDAR