5th International Workshop on Structures and Deduction
Affiliated with FSCD '19.
Dortmund, Germany, June 29-30, 2019.
SD’19 is the fifth in a series of workshops aiming to gather various communities of structural proof theorists.
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 four previous editions of Structures and Deduction, the
last of which occurred in 2017.
We are in the process of creating a permanent online presence for matters relating to the Structures and Deduction workshop series.
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 cyclic proofs.
- Complexity theoretic aspects of proof representations, such as
decision procedures from proof search, proof complexity and
As well as theoretical work in the form of regular papers, we encourage submission of implementations, tools and system descriptions.
- Submission deadline: April 12, 2019.
- Notification: May 13, 2019.
- Workshop: June 29-30, 2019.
We welcome submissions of work that has already been published or currently submitted to a journal or conference. The following submission categories are welcome:
- Short abstracts. (up to 4 pages). Work-in-progress, perspectives on existing work.
- Extended abstracts. (up to 8 pages). Finished work, system descriptions, surveys.
The page limits above are only recommendations, there is no hard upper or lower bound, within reason.
Please prepare your work using the EasyChair style files. The submission page is here:
We do not intend to have published proceedings, as we encourage
people to present work in progress, or material that is already
submitted. If there is a strong demand among the participants we may
organise a special issue of an open access journal for full papers.
- David Cerna, Research Institute for Symbolic Computation, Austria.
- Pierre Clairambault (co-chair), CNRS and Ecole Normale Supérieure de Lyon, France.
- Anupam Das (co-chair), University of Copenhagen, Denmark.
- Alessio Guglielmi, University of Bath, UK.
- Stepan Kuznetsov, Steklov Mathematical Institute of RAS, Russia.
- Sonia Marin (co-chair), IT-University of Copenhagen, Denmark.
- Guillaume Munch-Maccagnoni, Inria Bretagne, France.
- Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brasil.
- Benjamin Ralph, Inria Saclay, France.
All questions about submissions should be addressed to firstname.lastname@example.org, or directly to one of the co-chairs.