This workshop is the fourth in a series of meetings that brings together researchers in different areas of proof theory. The main interest is in new algebraic and geometric results in proof theory which expand our abilities to manipulate proofs, help to reduce bureaucracy in deductive systems, and ultimately lead to new methods for proof search and new kinds of proof certificates. There have been three previous editions of Structures and Deduction, the last of which occurred in 2014. Since then there has been a tremendous amount of progress in the area, witnessed by multiple recent funded projects. As well as theoretical work in the form of regular papers, we encourage submission of implementations, tools and system descriptions.
Themes of the workshop include but are not limited to:
Syntactic representations of proofs, such as sequent calculi and deep inference systems, in their focussed and unfocussed variants.
Combinatorial representations of proofs, such as proof nets, flow graphs and expansion trees.
Algebraic representations of proofs, for example via game semantics or category theory.
Methods for proof manipulation and normal forms of proofs, such as cut-elimination, rule permutations and proof compression.
Formulas-as-types interpretations of proofs, such as Curry-Howard correspondences and witness extraction.
Methods for incorporating computation and rewriting in proof search, such as deduction modulo or fixed point definitions.
Complexity theoretic aspects of proof representations, such as decision procedures from proof search, proof complexity and normalisation complexity.
09月08日
2017
09月09日
2017
初稿截稿日期
初稿录用通知日期
注册截止日期
留言