Conference Information
FSCD 2024: International Conference on Formal Structures for Computation and Deduction
Submission Date:
Notification Date:
Conference Date:
Tallinn, Estonia
Viewed: 11368   Tracked: 3   Attend: 1

Call For Papers
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:

        Rewriting systems (string, term, higher-order, 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

    Methods in Computation and Deduction:
        Type systems (polymorphism, dependent, recursive, intersection, session, etc.)
        Induction, coinduction
        Matching, unification, completion, orderings
        Strategies (normalization, completeness, etc.)
        Tree automata
        Model building and model checking
        Proof search and theorem proving
        Constraint solving and decision procedures

        Operational semantics and abstract machines
        Game Semantics and applications
        Domain theory and categorical models
        Quantitative models (timing, probabilities, etc.)
        Quantum computation and emerging models in computation
    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

    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

    Formal Systems for Semantics and Verification in new challenging areas:
        Blockchain protocols
        Data bases
        Deep learning and machine learning algorithms
Last updated by Dou Sun in 2023-12-24
Related Conferences
CCFCOREQUALISShortFull NameSubmissionNotificationConference
ISCCNInternational Conference on Intelligent Systems, Communications and Computer Networks2022-06-15 2022-06-17
GameSecConference on Decision and Game Theory for Security2021-08-162021-09-122021-10-25
CCSBInternational Conference on Computer Science and Blockchain2023-07-31 2023-11-17
SmartTechConInternational Conference On Smart Technologies For Smart Nation2017-07-15 2017-08-17
MM&SecACM Workshop on Multimedia and Security 2012-06-082012-09-06
CMSBInternational Conference on Computational Methods in Systems Biology2013-04-172013-05-272013-09-23
ICCCEGInternational Conference on Cloud Computing and e-Governance2022-07-30 2022-08-26
BODYNETInternational Conference on Body Area Networks2015-06-012015-07-312015-09-28
EDUTInternational Conference on Education & Technology2023-08-052023-08-102023-08-12
b1TLCAInternational Conference on Typed Lambda Calculi and Applications2015-01-302015-04-022015-06-29