The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Goedel and Kreisel half a century ago, but probably the first version (around 1917) is the following conjecture by Hilbert: "Wenn ein Existenzbeweis in der Math. geführt worden ist, so ist stets auch die Entscheidung (durch endliche Zahl von Schritten, wie man zu zagen pflegt), ob ... möglich." Translation: "If an existence theorem is once derived in the mathematics, so is always also the determination [Entscheidung] (through a finite number of steps as they are used to say), or possible." Source
But the possibility of extracting useful computational content from classical proofs was taken seriously only from the 1990s on when it was discovered that proof interpretations based on Goedel's and Kreisel's ideas can provide new nontrivial algorithms and numerical results, and the Curry-Howard correspondence can be extended to classical logic via programming concepts such as continuations and control operators.
|
There are today two main lines of research.
The first studies some (version of lambda) calculus adapted to
represent classical logic, like the symmetric mu-calculs, or the X-calculus.
The second studies semantics for programs inspired by classical
proofs, like game semantic or learning algorithms. These two directions are
often independent.
This workshop aims to support a fruitful exchange of ideas between the
various lines of research on Classical Logic and Computation.
Topics of interest include, but are not limited to:
Steering committee |
|
Five submitted papers were accepted as full papers, and three were presented as short papers. The meeting was followed by general call for papers for a special issue of APAL (Annals of Pure and Applied Logic) on the topic of the workshop, for which ten papers were submitted, and six accepted. The special issue appeared as volume 153(1-3), 2008
Five submitted papers were accepted as full papers, and five were presented as short papers. The meeting was followed by general call for papers for a special issue of APAL (Annals of Pure and Applied Logic) on the topic of the workshop, for which 12 papers were submitted, and six accepted. The special issue appeared as voluem 161, 2010.
Six submitted papers were accepted as full papers, and two were presented as short papers. The proceedings of CL&C 2010 appeared as EPTCS 47, 2010. As for previous meetings, a special issue of APAL, associated with the workshop, is being prepared, for which a general call for papers was issued; it is scheduled to appear in 2012.