International Conference on Formal Structures for Computation and Deduction
摘要截稿:
全文截稿: 2018-01-15
开会时间: 2018-07-06
会议难度:
CCF分类: C类
会议地点: OXFORD, UK
Overview
FSCD (http://fscd-conference.org/) 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 logics, proof theory and new emerging models of computation such as quantum computing or homotopy type theory.
Suggested, but not exclusive, list of topics for submission are: 1. Calculi: • Lambda calculus • Concurrent calculi • Logics • Rewriting systems • Proof theory • Type theory and logical frameworks 2. Methods in Computation and Deduction: • Type systems • Induction and coinduction • Matching, unification, completion, and orderings • Strategies • Tree automata • Model checking • Proof search and theorem proving • Constraint solving and decision procedures 3. Semantics: • Operational semantics • Abstract machines • Game Semantics • Domain theory and categorical models • Quantitative models 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 • Libraries for proof assistants and interactive theorem provers • Case studies in proof assistants and interactive theorem provers • Certification • Applications to security, planning, data bases.