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/2017/newsitem/9060/3--
 -6-July-2017-Summer-School-on-Logic-in-Computer-Sc
 ience-Warsaw-Poland
DTSTAMP:20170520T170832
SUMMARY:Summer School on Logic in Computer Science
 , Warsaw, Poland
DTSTART;VALUE=DATE:20170703
DTEND;VALUE=DATE:20170706
LOCATION:Warsaw, Poland
DESCRIPTION:The Lipa Summer School is a school on 
 topics connected to logic in computer science. The
  school consists of 4 mini-courses given by: Steph
 an Kreutzer (Berlin) Algorithmic meta-theoremsJoël
  Ouaknine (Saarbrücken) Decision Problems for Line
 ar Recurrence SequencesMoshe Vardi (Rice)  Linear-
 time verification and synthesisMikołaj Bojańczyk (
 Warsaw, organiser) What is a recognisable language
 ? Each mini-course is 6 hours long (4 x 90 minutes
 ). The school is followed by ICALP.
X-ALT-DESC;FMTTYPE=text/html:\n  <p>The Lipa Summe
 r School is&nbsp;a school on topics connected to l
 ogic in computer science. The school consists of&n
 bsp;4 mini-courses given by:</p>\n\n  <ul>\n    <l
 i>Stephan Kreutzer (Berlin)&nbsp;Algorithmic meta-
 theorems</li>\n\n    <li>Joël Ouaknine (Saarbrücke
 n) Decision Problems for Linear Recurrence Sequenc
 es</li>\n\n    <li>Moshe Vardi (Rice)&nbsp;&nbsp;L
 inear-time verification and synthesis</li>\n\n    
 <li>Mikołaj Bojańczyk (Warsaw, organiser) What is 
 a recognisable language?</li>\n  </ul>\n\n  <p>Eac
 h mini-course is 6 hours long (4 x 90 minutes). Th
 e school is followed by ICALP.</p>\n
URL:https://www.mimuw.edu.pl/~bojan/lipa-summer-sc
 hool
END:VEVENT
END:VCALENDAR