Conference Information
FSCD 2026: International Conference on Formal Structures for Computation and Deduction
Please Login to view website of conference

Submission Date:
2026-01-23
Notification Date:
2026-04-16
Conference Date:
2026-07-20
Location:
Lisbon, Portugal
Years:
11
Viewed: 18289   Tracked: 3   Attend: 1

Call For Papers
OVERVIEW

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:

1. 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

2. 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

3. 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

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
Verification tools
Proof assistants and interactive theorem provers
Applications in industry
Applications of formal systems in other sciences
Applications of formal systems in education

6. Formal Systems for Modelling and Verification in New Challenging Areas

Certification
Security
Blockchain
Databases
Deep learning and machine learning algorithms
Planning
Last updated by Dou Sun in 2026-03-02
Related Conferences