8th Proof, Computation and Complexity
PCC 2009

2nd July 2009
LORIA - Nancy, France

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.


09h30 - 10h00 - Welcome
10h00 - 11h00 - Lars Kristiansen, Oslo - TBA
11h00 - 12h00 - Philippe de Groote, Nancy - TBA
12h00 - 12h45 - Bedeho Mender, Oslo - The Semantics and Complexity of Successor-free non deterministic Godel T and PCF
14h00 - 15h00 - Patrick Baillot, Lyon - From light linear logic to a functional programming language for polynomial time complexity.
15h00 - 15h45 - Bruno Woltzenlogel Paleo, Vienna - Introduction of Atomic-Cuts (and Proof Compression) by Resolution: Preliminary Investigations
15h45 - 16h30 - Marc Lasson, Paris, Extending FA for programming in elementary time.

Past events were held


Invited Speakers


PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (LaTeX, 1-2 pages). The collection of abstracts will be available at the meeting.

Important Dates

Submission deadline :   10 of june 2009
Notification to authors :   15 June 2009
Workshop:               2-3 July 2009

Submission of abstract: {bonfante, marionjy}@loria.fr

When and where

The conference will be held the 2nd of July 2009 at the LORIA (http://www.loria.fr/access-en/acceder/the-way-to-loria/view?set_language=en), the computer science laboratory of Nancy University.

This workshop is supported by