征稿已开启

查看我的稿件

注册已开启

查看我的门票

已截止
活动简介

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 logics, proof theory and new emerging models of computation such as quantum computing or homotopy type theory.

征稿信息

重要日期

2017-04-07
摘要截稿日期
2017-04-14
初稿截稿日期
2017-06-14
初稿录用日期

征稿范围

Suggested, but not exclusive, list of topics for submission are:

Calculi

  • Lambda calculus

  • Concurrent calculi

  • Logics

  • Rewriting systems

  • Proof theory

  • Type theory and logical frameworks

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

Semantics

  • Operational semantics

  • Abstract machines

  • Game Semantics

  • Domain theory and categorical models

  • Quantitative models

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

  • Libraries for proof assistants and interactive theorem provers

  • Case studies in proof assistants and interactive theorem provers

  • Certification

留言
验证码 看不清楚,更换一张
全部留言
重要日期
  • 会议日期

    09月03日

    2017

    09月09日

    2017

  • 04月07日 2017

    摘要截稿日期

  • 04月14日 2017

    初稿截稿日期

  • 06月14日 2017

    初稿录用通知日期

  • 09月09日 2017

    注册截止日期

移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询