5th International Conference on Formal Structures for Computation and Deduction

Paris Nord Summer of LoVe

FSCD 2020 is part of Paris Nord Summer of LoVe 2020 a joint event on Logic and Verification at Université Paris 13, made of Petri Nets 2020, IJCAR 2020, FSCD 2020 and over 20 satellite events, organised by the Logic and Verification (LoVe) team of Laboratoire d’Informatique de Paris Nord (LIPN).

FSCD 2020

The 5th FSCD (Int. Conf. on Formal Structures for Computation and Deduction) will be held in Paris, France from June 29 to July 5, 2020 colocated with the 10th IJCAR.

FSCD

FSCD is a series of annual conferences started in 2016 in Porto, to merge and replace the

RTA (Rewriting Techniques and Applications)
TLCA (Typed Lambda Calculi and Applications)

conferences.

Building on the RTA and TLCA communities, FSCD updates and modernizes the RTA and TLCA core topics and broadens their scope to closely related areas in logics, models of computation (e.g. quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g. blockchain protocols or deep learning algorithms).

FSCD 2020 is the 5th edition of FSCD and accepts submissions in two categories: original and unpublished regular research papers presenting original and unpublished research; system descriptions about software tools.

Recent editions of FSCD have been held in:

FSCD 2020 Website: http://fscd2020.org

Affiliated Workshops

Several one or two days workshops will be held as satellite pre/post-events of FSCD and IJCAR. A call has been opened in November 2019, inviting to submit proposals for workshops, tutorials or other satellite events, on any topic related to formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications.

21 workshops have been proposed and accepted. Their scopes include topics as: termination and confluence of rewriting systems, term graph rewriting, rewriting techniques for program transformations and avaluation, unification, linear logic and linearity in logic and computing, semantic and formal approaches for complexity, geometric and categorical structures for computation and deduction, homotopy type theory and univalent foundations, logical frameworks and meta-languages, automated reasoning for quantified non-classical logic, automated theorem provers as Isabelle, Coq, and Zipperpositions, pratical aspects of automated reasoning, theorem provers for eductional software, satisfiability checking and symbolic computation there will be an interactive theorem proving contest.

Many of these workshops are recurrent. In particular, we point out the 5th edition of the Women in Logic workshop.

More info