FSCD 2016 - First International Conference on Formal Structures for Computation and Deduction

He FSCD conference aims to cover all aspects of formal structures for computation and deduction, from theoretical foundations to tools and applications. Suggested, but not exclusive, list of topics for submission are the following, also listed in the call-for-papers.
Calculi
Lambda-calculus
Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.)
Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.)
Proof theory (natural deduction, sequent calculus, proof nets, etc.)
Type theory and logical frameworks
Homotopy type theory
Methods in Computation and Deduction
Type systems (polymorphism, dependent, recursive, intersection, session, etc.)
Induction, coinduction
Matching, unification, completion, orderings
Strategies (normalization, completeness, etc.)
Tree automata
Model building and model checking
Proof search (resolution, paramodulation, narrowing, focusing, etc.)
Constraint solving and decision procedures
Semantics
Operational semantics and abstract machines
Game Semantics and applications
Domain theory and categorical models
Quantitative models (timing, probabilities, resources, etc.)
Quantum computation and emerging models in computation
Algorithmic Analysis and Transformations of Formal Systems
Type Inference and type checking
Abstract Interpretation
Complexity analysis and implicit computational complexity
Checking termination, confluence, derivational complexity and related properties
Symbolic computation
Tools and Applications
Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.)
Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.)
Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.)
Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications)
Certifications (theorems, rewriting techniques, etc.)
Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.)