Tentative Call for Papers

FSCD conference aims to cover all aspects of formal structures in computation and deduction from theoretical foundations to tools and applications. We do not only encourage submissions falling into all areas traditionally covered by RTA and TLCA, but also papers covering any of the topics below.

  1. Calculi
    • Lambda calculus
    • Logics (first-order, higher-order, equational, modal, linear, classical, constructive, ...)
    • Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, ...)
    • Proof theory (natural deduction, sequent calculus, proof nets, ...)
    • Type theory and logical frameworks
    • Homotopy type theory
  2. Methods in Computation and Deduction
    • Type systems (polymorphism, dependent, recursive, intersection, session, ...)
    • Induction, coinduction
    • Matching, unification, completion, orderings
    • Strategies (normalization, completeness, ...)
    • Tree automata
    • Model building and model checking
    • Proof search (resolution, paramodulation, narrowing, tableaux, focusing, ...)
    • Constraint solving and decision procedures
  3. Semantics
    • Operational semantics and abstract machines
    • Game Semantics and applications
    • Domain theory and categorical models
    • Quantitative models (timing, probabilities, resources, ...)
    • Quantum computation and emerging models in computation
  4. 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
  5. Tools and Applications
    • Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, ...)
    • Verification tools (abstract interpretation, termination, confluence, specialized provers, ...)
    • Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality,...)
    • Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications)
    • Certifications (theorems, rewriting techniques, ...)
    • Applications of formal systems inside and outside of CS (biology, linguistics, physics, ...)
Design downloaded from Free Templates