\n

\n The aim of PCC is to stimulate research in pr oof theory, computation,\n and complexity, focusing on issues which combine logical and\n computational aspects. Topics may include appl ications of formal\n inference systems in c omputer science, as well as new developments in\n proof theory motivated by computer science demands. Specific areas of\n interest are ( non-exhaustively listed) foundations for specifica tion\n and programming languages, logical m ethods in specification and\n program devel opment including program extraction from proofs, t ype\n theory, new developments in structura l proof theory, and implicit\n computationa l complexity.\n

\n\n PCC 2014 is organised as a satellite event of TYPES\n 2014. Registration for PCC 2014 will be thr ough the TYPES 2014\n site, with details to be announced later on. The workshop is\n s cheduled for the full day of Friday, May 16. The p articipants\n are encouraged to attend the Thursday sessions of TYPES\n 2014. If the n umber and quality of submissions justifies this,\n then PCC 2014 will start in the afternoon of Thursday, May 15.\n This will be known b y the notification date.\n

\n \n \nFor more information, see\n http://www.irit.fr/PCC2014/\n

\n < /div>\n

URL:/NewsandEvents/Events/Conferences/newsitem/556
7/15-16-May-2014-Proof-Computation-and-Complexity-
PCC-2014-Paris-France
END:VEVENT
END:VCALENDAR
\n PCC is intended to be a lively forum for presenting and\n disc ussing recent work. We solicit contributions in th e fields\n of PCC, non-exhaustively describ ed above. Deadline for\n proposing a contr ibuted talk: Monday, March 3, 2014.\n

\n