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/9172/26-
 --27-July-2017-Sixteenth-International-Workshop-on
 -Proof-Computation-Complexity-PCC-2017-Goettingen-
 Germany
DTSTAMP:20170626T142451
SUMMARY:Sixteenth International Workshop on Proof,
  Computation & Complexity (PCC 2017), Goettingen, 
 Germany
DTSTART;VALUE=DATE:20170726
DTEND;VALUE=DATE:20170727
LOCATION:Goettingen, Germany
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. PCC 2017 will includ
 e an unveiling ceremony of a commemorative plaque 
 for Paul Bernays.     We solicit contributions in 
 the fields of PCC. Specific areas of interest are 
 (non-exhaustively listed) foundations for specific
 ation and programming languages, logical methods i
 n specification and program development including 
 program extraction from proofs, type theory, new d
 evelopments in structural proof theory, and implic
 it computational complexity.  PCC is intended to b
 e a lively forum for presenting and discussing rec
 ent work. Progress on a not yet satisfactorily sol
 ved problem may well be worth presenting - in part
 icular if the discussions during the workshop migh
 t lead towards a solution.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>The aim o
 f PCC is to stimulate research in proof theory, co
 mputation, and complexity, focusing on issues whic
 h combine logical and computational aspects. Topic
 s may include applications of formal inference sys
 tems in computer science, as well as new developme
 nts in proof theory motivated by computer science 
 demands. PCC 2017 will include an unveiling ceremo
 ny of a commemorative plaque for Paul Bernays.</p>
 \n\n  <p>&nbsp;</p>\n</div><div>\n  <p>We solicit 
 contributions in the fields of PCC. Specific areas
  of interest are (non-exhaustively listed) foundat
 ions for specification and programming languages, 
 logical methods in specification and program devel
 opment including program extraction from proofs, t
 ype theory, new developments in structural proof t
 heory, and implicit computational complexity.</p>\
 n\n  <p>PCC is intended to be a lively forum for p
 resenting and discussing recent work. Progress on 
 a not yet satisfactorily solved problem may well b
 e worth presenting - in particular if the discussi
 ons during the workshop might lead towards a solut
 ion.</p>\n</div>
URL:https://www.irit.fr/PCC2017/
END:VEVENT
END:VCALENDAR