15-16 May 2014, Proof, Computation and Complexity (PCC 2014), Paris, France

The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational 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 interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity.

PCC 2014 is organised as a satellite event of TYPES 2014. Registration for PCC 2014 will be through the TYPES 2014 site, with details to be announced later on. The workshop is scheduled for the full day of Friday, May 16. The participants are encouraged to attend the Thursday sessions of TYPES 2014. If the number and quality of submissions justifies this, then PCC 2014 will start in the afternoon of Thursday, May 15. This will be known by the notification date.

For more information, see http://www.irit.fr/PCC2014/