会議情報
FSCD 2026: International Conference on Formal Structures for Computation and Deduction
会議のウェブサイトを表示するにはログインしてください
提出日: |
2026-01-23 |
通知日: |
2026-04-16 |
会議日: |
2026-07-20 |
場所: |
Lisbon, Portugal |
年: |
11 |
閲覧: 18444 追跡: 3 出席: 1
論文募集
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
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
最終更新 Dou Sun 2026-03-02
関連会議
関連仕訳帳
| CCF | 完全な名前 | インパクト ・ ファクター | 出版社 | ISSN |
|---|---|---|---|---|
| International Journal of Critical Infrastructure Protection | 5.3 | Elsevier | 1874-5482 | |
| Foundations of Computational Mathematics | 2.7 | Springer | 1615-3375 | |
| IEEE Journal on Exploratory Solid-State Computational Devices and Circuits | 2.7 | IEEE | 2329-9231 | |
| Journal of Computational Electronics | 2.5 | Springer | 1569-8025 | |
| Advances in Computational Mathematics | 2.1 | Springer | 1019-7168 | |
| b | Neural Computation | 2.1 | MIT Press | 0899-7667 |
| Concurrency Computation Practice and Experience | 1.500 | Wiley-Blackwell | 1532-0626 | |
| b | Formal Aspects of Computing | 1.400 | ACM | 0934-5043 |
| a | Information and Computation | 1.0 | Elsevier | 0890-5401 |
| ACM Transactions on Economics and Computation | 0.9 | ACM | 2167-8375 |