[loginf] Call for contributions PCC'13 - Proof, Computation and Complexity, held in Toulouse

Reinhard Kahle kahle at fct.unl.pt
Mon Feb 11 22:03:57 UTC 2013

PCC 2013
Proof, Computation and Complexity
Twelfth International Workshop
April 22-23, 2013, Toulouse, France

co-located with the TYPES Meeting 2013

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 complexity.

The context
PCC 2013 is organised as a satellite event of TYPES 2013. Registration
for PCC 2013 will be through the TYPES 2013 site for a low fee that
covers mostly coffee and lunch breaks.

The workshop is scheduled for the full day of Monday, April 22. The
participants are encouraged to attend the Tuesday morning session of
TYPES 2013. If the number and quality of submissions justifies this,
then PCC 2013 will continue in the afternoon of Tuesday, April 23.
This will be known by the notification date.

- Birgit Elbl, UniBw München, Neubiberg, Germany
- Reinhard Kahle, Universidade Nova de Lisboa, Portugal (co-chair)
- Lars Kristiansen, University of Oslo, Norway
- Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair)

Contributed talks
PCC is intended to be a lively forum for presenting and discussing
recent work. We solicit contributions in the fields of PCC,
non-exhaustively described above. Please register a contribution at
the EasyChair site for PCC 2013 at
(accepts submissions - if not, please inform pcc2013 at easychair.org or
directly contact the organizers). This consists in a title, a short
text-only abstract and the PDF file of a LaTeX abstract that fits on
one page in format A4. For some more details on the contributions,
please consult the web page of PCC'13.

Important dates
- Deadline for proposing a contributed talk: Monday, February 25
- Notification of acceptance: Friday, March 8

Past events
- 2012 in Copenhagen, co-located with the 8th Scandinavian Logic Symposium
- 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
- 2002 in Tübingen

More information about the loginf mailing list