17-18 July 2014, International Workshop on Proof, Structure and Computation (PSC 2014), Vienna, Austria

The extraction of computational content from proofs has a long tradition in logic, but usually depends on a concrete encoding that allows us to turn proofs into algorithms. A recent trend in this field is the departure from such encoding which not only makes it simpler to represent the mathematical content, but also makes the extracted computational content encoding independent. This shift in focus allows us to focus on what is relevant: the computational aspects of proofs and the specification (not representation) of the structures involved. We now have growing evidence that this move from representations (e.g. the signed digit representation of the reals) to axioms (e.g. of the real numbers) is possible. This development largely parallels the step from assembler to high level languages in programming. As a by-product this move has already opened up the possibility to gain computational information from axiomatic proofs in more abstract and genuinely structural areas of mathematics such as algebra and topology.

For more information, see http://vsl2014.at/psc/ or contact psc2014 at easychair.org.