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/2018/newsitem/9945/19-
 --20-July-2018-17th-International-Workshop-on-Proo
 f-Computation-Complexity-PCC-2018-Bonn-Germany
DTSTAMP:20180430T135546
SUMMARY:17th International Workshop on Proof, Comp
 utation, & Complexity (PCC 2018), Bonn, Germany
DTSTART;VALUE=DATE:20180719
DTEND;VALUE=DATE:20180720
LOCATION:Bonn, 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. 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.  PCC 2018 
 is organized as external event for the trimester o
 n "Types, Sets and Constructions" of the Hausdorff
  Research Institute for Mathematics.  We solicit c
 ontributions in the fields of PCC, non-exhaustivel
 y described above. Constributions should consist o
 f a title, a short text-only abstract and the PDF 
 file of a LaTeX abstract that fits on one page in 
 format A4. PCC is intended to be a lively forum fo
 r presenting and discussing recent work. Progress 
 on a not yet satisfactorily solved problem may wel
 l be worth presenting - in particular if the discu
 ssions during the workshop might lead towards a so
 lution.
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. Specific areas of interest are (non-exhau
 stively listed) foundations for specification and 
 programming languages, logical methods in specific
 ation and program development including program ex
 traction from proofs, type theory, new development
 s in structural proof theory, and implicit computa
 tional complexity.</p>\n\n  <p>PCC 2018 is organiz
 ed as external event for the trimester on &quot;Ty
 pes, Sets and Constructions&quot; of the Hausdorff
  Research Institute for Mathematics.</p>\n</div><d
 iv>\n  <p>We solicit contributions in the fields o
 f PCC, non-exhaustively described above. Constribu
 tions should consist of a title, a short text-only
  abstract and the PDF file of a LaTeX abstract tha
 t fits on one page in format A4. PCC is intended t
 o be a lively forum for presenting and discussing 
 recent work. Progress on a not yet satisfactorily 
 solved problem may well be worth presenting - in p
 articular if the discussions during the workshop m
 ight lead towards a solution.</p>\n</div>
URL:https://www.irit.fr/PCC2018/
END:VEVENT
END:VCALENDAR