\n

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

\n

URL:/NewsandEvents/Archives/2012/newsitem/4543/17-
18-August-2012-Proof-Computation-and-Complexity-PC
C-2012-Copenhagen-Denmark
END:VEVENT
END:VCALENDAR
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