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/2012/newsitem/4543/17- 18-August-2012-Proof-Computation-and-Complexity-PC C-2012-Copenhagen-Denmark DTSTAMP:20120617T000000 SUMMARY:Proof, Computation and Complexity (PCC 201 2), Copenhagen, Denmark DTSTART;VALUE=DATE:20120817 DTEND;VALUE=DATE:20120818 LOCATION:Copenhagen, Denmark 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://diku.dk/pcc_2012/. PCC is intended to be a lively forum for presenting an d discussing recent work. Participants who want to contribute a talk are kindly invited to submit an abstract to Reinhard Kahle (kahle at mat.uc.pt) b y 15 July 2012. X-ALT-DESC;FMTTYPE=text/html:
The a im of PCC is to stimulate research in proof theory ,\n computation, and complexity, focusing on issues which combine\n logical and computatio nal aspects. Topics may include\n application s of formal inference systems in computer science, as\n well as new developments in proof theor y motivated by computer\n science demands. Sp ecific areas of interest are\n (non-exhaustiv ely listed) foundations for specification and\n programming languages, logical methods in speci fication and\n program development including program extraction from proofs,\n type theory , new developments in structural proof theory, and \n implicit computational complexity.\n
\n \n \nFor more information, see\n http://diku.dk/pcc_2012/.\n
PCC is intended to be a lively forum for presenting and\n discussin g recent work. Participants who want to contribute a\n talk are kindly invited to submit an abs tract to Reinhard Kahle\n (k ahle at mat.uc.pt) by 15 July 2012.\n
\n