Please note that this newsitem has been archived, and may contain outdated information or links.
19 - 20 July 2018, 17th International Workshop on Proof, Computation, & Complexity (PCC 2018), Bonn, Germany
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 2018 is organized as external event for the trimester on "Types, Sets and Constructions" of the Hausdorff Research Institute for Mathematics.
We solicit contributions in the fields of PCC, non-exhaustively described above. Constributions should consist of a title, a short text-only abstract and the PDF file of a LaTeX abstract that fits on one page in format A4. PCC is intended to be a lively forum for presenting and discussing recent work. Progress on a not yet satisfactorily solved problem may well be worth presenting - in particular if the discussions during the workshop might lead towards a solution.
Please note that this newsitem has been archived, and may contain outdated information or links.