[loginf] PCC'12 in Copenhagen

Reinhard Kahle kahle at fct.unl.pt
Wed Jul 11 15:35:32 UTC 2012

DEADLINE: 15 July 2012
PCC 2012
Proof, Computation and Complexity
17-18 August 2012, University of Copenhagen, Denmark

co-located with the 8th Scandinavian Logic Symposium

Aim and scope
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 

PCC is intended to be a lively forum for presenting and 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) by 15 
July 2012.

The workshop is held at the Northern Campus of the University of 
Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark.

- Reinhard Kahle, Lisbon
- Lars Kristiansen, Oslo
- Jakob Grue Simonsen, Copenhagen

Past events
- 2011 in Ghent
- 2010 in Bern
- 2009 in Nancy
- 2008 in Oslo
- 2007 in Swansea, co-located with the British Mathematical Colloquium 2007,
- 2006 in Ilmenau,
- 2005 in Lisbon, as affiliated Workshop to ICALP '05,
- 2004 in Dresden, in conjunction with the Summer School on Proof Theory
and Automated Theorem Proving,
- 2003 in Dresden, in conjunction with the Summer School on Proof
Theory, Computation, and Complexity, and
- 2002 in Tübingen.

More information about the loginf mailing list