[et_pb_section fb_built=”1″ next_background_color=”#ffffff” _builder_version=”4.16″ background_color=”#8c8c8c” top_divider_color=”#b53319″ bottom_divider_style=”arrow3″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ custom_margin=”-26px|auto||auto||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ custom_padding=”||2px|||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.17.4″ global_colors_info=”{}”]<\/p>\n
FSCD<\/a> 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.<\/p>\n The suggested, but not exclusive, list of topics for submission is:<\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_2,1_2″ _builder_version=”4.17.4″ _module_preset=”default” custom_padding=”||0px|||” global_colors_info=”{}”][et_pb_column type=”1_2″ _builder_version=”4.17.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.17.4″ global_colors_info=”{}”]<\/p>\n \u00a01. Calculi:<\/span> 3. Semantics:<\/span> 5. Tools and Applications:<\/span> \u00a0<\/a><\/p>\n <\/p>\n [\/et_pb_text][\/et_pb_column][et_pb_column type=”1_2″ _builder_version=”4.17.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.17.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n 2. Methods in Computation and Deduction:<\/span> 4. Algorithmic Analysis and Transformations of Formal Systems:<\/span> 6. Formal Systems for Semantics and Verification in new challenging areas:<\/span> [\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.17.4″ _module_preset=”default” custom_padding=”2px|||||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.17.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.19.4″ _module_preset=”default” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access.<\/p>\n We aim to have a special issue of Logical Methods in Computer Science of selected papers. More details will be provided later.<\/p>\n The submission site is: https:\/\/easychair.org\/conferences\/?conf=fscd2023<\/a><\/p>\n
\u00a0 – Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.);
\u00a0 – Lambda calculus;
\u00a0 – Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.);
\u00a0 – Proof theory (natural deduction, sequent calculus, proof nets, etc.);
\u00a0 – Type theory and logical frameworks;
\u00a0 – Homotopy type theory;
\u00a0 – Quantum calculi.<\/p>\n
\u00a0 – Operational semantics and abstract machines;
\u00a0 – Game Semantics and applications;
\u00a0 – Domain theory and categorical models;
\u00a0 – Quantitative models (timing, probabilities, etc.);
\u00a0 – Quantum computation and emerging models in computation.<\/p>\n
\u00a0 – Programming and proof environments;
\u00a0 – Verification tools;
\u00a0 – Proof assistants and interactive theorem provers;
\u00a0 – Applications in industry;
\u00a0 – Applications of formal systems in other sciences;
\u00a0 – Applications of formal systems in education.<\/p>\n
\u00a0 – Type systems (polymorphism, dependent, recursive, intersection, session, etc.);
\u00a0 – Induction, coinduction;
\u00a0 – Matching, unification, completion, orderings;
\u00a0 – Strategies (normalization, completeness, etc.);
\u00a0 – Tree automata;
\u00a0 – Model building and model checking;
\u00a0 – Proof search and theorem proving;
\u00a0 – Constraint solving and decision procedures.<\/p>\n
\u00a0 – Type inference and type checking;
\u00a0 – Abstract Interpretation;
\u00a0 – Complexity analysis and implicit computational complexity;
\u00a0 – Checking termination, confluence, derivational complexity and related properties;
\u00a0 – Symbolic computation.<\/p>\n
\u00a0 – Certification;
\u00a0 – Security;
\u00a0 – Blockchain protocols;
\u00a0 – Data bases;
\u00a0 – Deep learning and machine learning algorithms;
\u00a0 – Planning.<\/p>\nPUBLICATION<\/span><\/h3>\n
SPECIAL ISSUE<\/span><\/h3>\n
SUBMISSION GUIDELINES<\/span><\/h3>\n