Información de la conferencia
FSCD 2026: International Conference on Formal Structures for Computation and Deduction
Por favor Iniciar para ver el sitio web del congreso

Día de Entrega:
2026-01-23
Fecha de Notificación:
2026-04-16
Fecha de Conferencia:
2026-07-20
Ubicación:
Lisbon, Portugal
Años:
11
Vistas: 18214   Seguidores: 3   Asistentes: 1

Solicitud de Artículos
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
Última Actualización Por Dou Sun en 2026-03-02
Conferencias Relacionadas
CCFCOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónConferencia
baa2PACTInternational Conference on Parallel Architectures and Compilation Techniques2026-04-172026-08-052026-10-19
bHSCCInternational Conference on Hybrid Systems: Computation and Control2025-11-062026-01-292026-05-11
bb2SIROCCOInternational Colloquium on Structural Information and Communication Complexity2025-11-022026-01-202026-06-09
cb1FMCADFormal Methods in Computer-Aided Design2025-04-202025-07-012025-10-06
aa2FoSSaCSInternational Conference on Foundations of Software Science and Computation Structures2024-10-102024-12-202025-05-03
b4WCCIIEEE World Congress on Computational Intelligence2024-01-152024-03-152024-06-30
cACHIInternational Conference on Advances in Computer-Human Interactions2023-02-012023-02-282023-04-24
ab2FCTInternational Symposium on Fundamentals of Computation Theory2019-04-142019-05-192019-08-11
cb4ICNC'International Conference on Natural Computation2018-06-202018-07-28
b4BIOCOMPInternational Conference on Bioinformatics & Computational Biology2015-04-152015-04-302015-07-27
Revistas Relacionadas