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/2010/newsitem/3162/18-
 --19-June-2010-Proof-Computation-Complexity-PCC-Be
 rn
DTSTAMP:20091220T000000
SUMMARY:Proof, Computation, Complexity (PCC), Bern
DTSTART;VALUE=DATE:20100618
DTEND;VALUE=DATE:20100619
LOCATION:Bern
DESCRIPTION:The aim of PCC is to stimulate researc
 h in proof theory, computation, and complexity, fo
 cusing on issues which combine logical and computa
 tional aspects. Topics may include applications of
  formal inference systems in computer science, as 
 well as new developments in proof theory motivated
  by computer science demands. Specific areas of in
 terest are (non-exhaustively listed) foundations f
 or specification and programming languages, logica
 l methods in specification and program development
  including program extraction from proofs, type th
 eory, new developments in structural proof theory,
  and implicit computational complexity.   For more
  information, see http://pcc2010.unibe.ch/   The P
 rogramme Committee cordially invites all researche
 rs to submit their papers for presentation. Submis
 sion deadline is April 1st, 2010.
X-ALT-DESC;FMTTYPE=text/html:<div>\n        <p>\n 
        The aim of PCC is to stimulate research in 
 proof theory, computation,\n        and complexity
 , focusing on issues which combine logical and\n  
       computational aspects. Topics may include ap
 plications of formal\n        inference systems in
  computer science, as well as new developments in\
 n        proof theory motivated by computer scienc
 e demands. Specific areas of\n        interest are
  (non-exhaustively listed) foundations for specifi
 cation\n        and programming languages, logical
  methods in specification and\n        program dev
 elopment including program extraction from proofs,
  \n        type theory, new developments in struct
 ural proof theory, and implicit \n        computat
 ional complexity.\n        </p>\n    \n      \n   
    <p>For more information, see\n        <a target
 ="_blank" href="http://pcc2010.unibe.ch/">http://p
 cc2010.unibe.ch/</a></p>\n    </div><div>\n      <
 p>\n        The Programme Committee cordially invi
 tes all researchers\n        to submit their\n    
     papers for presentation.\n        Submission d
 eadline is April 1st, 2010.\n      </p>\n      </d
 iv>
URL:/NewsandEvents/Archives/2010/newsitem/3162/18-
 --19-June-2010-Proof-Computation-Complexity-PCC-Be
 rn
END:VEVENT
END:VCALENDAR