PCC 2012 - Proof, Computation, Complexity
17-18 August 2012, University of Copenhagen, Denmark
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 participants may also be interested in joining the 8th Scandinavian Logic Symposium, which is held nearby at Roskilde University (RUC) on 20-21 August 2012.
The workshop is held at the Northern Campus of the University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark. The session on Friday 17 August takes place at room 1-0-14. The session on Saturday 18 August takes place at meeting room A+B.
- Reinhard Kahle, Lisbon
- Lars Kristiansen, Oslo
- Jakob Grue Simonsen, Copenhagen
Local Organising Committee
See program and more info: http://diku.dk/pcc_2012/
Participation is free, but registration is required. Participants who are not giving a talk are kindly asked to write an e-mail Jakob Grue Simonsen for registration.