FSCD covers all aspects of formal structures for computation and deduction, from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logic, models of computation, semantics and verification in new challenging areas.

The suggested, but not exclusive, list of topics for submission is:

    Calculi:
        Rewriting systems (string, term, higher-order, nominal, graph, conditional, modulo, infinitary, etc.);
        Lambda calculus;
        Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.);
        Proof theory (natural deduction, sequent calculus, proof nets, etc.);
        Type theory and logical frameworks;
        Homotopy type theory;
        Process algebras (synchronous, asynchronous, static and dynamic semantics with and without time, etc.);
        Quantum calculi.
    Methods in Computation and Deduction:
        Type systems (polymorphism, dependent, recursive, intersection, session, etc.);
        Induction, coinduction;
        Matching, unification, completion, orderings;
        Strategies (normalisation, completeness, etc.);
        Tree automata;
        Model building and model checking;
        Proof search and theorem proving;
        Constraint solving and decision procedures.
    Semantics:
        Operational semantics and abstract machines;
        Game Semantics and applications;
        Domain theory and categorical models;
        Quantitative models (timing, probabilities, etc.);
        Quantum computation and emerging models of 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;
        Verification tools;
        Proof assistants and interactive theorem provers;
        Applications in industry;
        Applications of formal systems in other sciences;
        Applications of formal systems in education.
    Formal Systems for Modelling and Verification in new challenging areas:
        Certification;
        Security;
        Blockchain;
        Databases;
        Deep learning and machine learning algorithms;
        Planning.