FSCD Declaration

It is our thesis that formal elegance is
a prerequisite to efficient implementation.
-- Gérard Huet

We, the communities behind the RTA and TLCA conferences, believe that our field has evolved and developed richer connections with many both practical and theoretical aspects of computer science and logic research since the inception of RTA in 1983 and TLCA in 1993. In particular, the scope of the two original conferences widened to include a significant overlap, and in fact the conferences have already collaborated by having most of our meetings since 2003 as the joint RDP conference.

We have therefore decided to propose a new conference,

Formal Structures for Computation and Deduction (FSCD)

which not only combines our scope but further extends it to cover all the inter-related formal areas that researchers in formal structures for computation and deduction engage in.

The name of the new conference comes from an unpublished but important book by Gérard Huet that was a strong influence on many researchers in our area. We are grateful to Gérard for allowing us to reuse the name.

The extended scope of the conference will include all research related to formal structures for computation and deduction, in particular all areas/categories included in the attached non-exhaustive list of topics.

We look very much forward to serve the scientific community with this new conference, which inherits as well as updates and modernizes the scope of the conferences it replaces.


FSCD initial non-exhaustive list of topics (intended to extend the current RTA and TLCA scope, and expected to evolve over time):

  1. Calculi
    1. Lambda-calculus
    2. Rewriting formats (string, term, higher-order, graph, conditional, ...)
    3. Proof theory (natural deduction, sequent calculi, proof nets, ...)
    4. Strategies in computation and deduction
  2. Type Theory and Logical Frameworks
    1. Type systems (recursive, intersection types, polymorphism, ...)
    2. Dependent types and homotopy type theory
    3. Linear logic and other constructive logics
    4. Implicit complexity
  3. Fundamentals of Functional and Declarative Programming
    1. Unification and narrowing
    2. Tree automata
    3. Continuations and control operators
    4. Coinduction and infinitary systems
  4. Semantics
    1. Abstract machines
    2. Categorical semantics
    3. Denotational and game semantics
    4. Quantitative models (timing, probabilities)
  5. Algorithmic Analysis of Formal Systems
    1. Type inference and type checking
    2. Complexity analysis
    3. Checking termination, confluence, and related properties
    4. Formalisation and certification
  6. Tools and Applications
    1. Proof assistants and interactive theorem proving
    2. Automated deduction (completion, constraints, equational logic...)
    3. Symbolic computation
    4. Implementation techniques for formal systems
    5. Case studies and applications based on formal systems