posted by user: hossein_haeri || 1599 views || tracked by 7 users: [display]

FSCD 2016 : First International Conference on Formal Structures for Computation and Deduction


When Jun 22, 2016 - Jun 26, 2016
Where Porto, Portugal
Abstract Registration Due Jan 29, 2016
Submission Deadline Feb 5, 2016
Notification Due Apr 6, 2016
Categories    calculi   computation and deduction   semantics   formal systems

Call For Papers

First International Conference on Formal Structures for
Computation and Deduction (FSCD'16)

22 June -- 26 June 2016, Porto, Portugal


Abstract Submission: 29 January 2016
Paper Submission : 5 February 2016
Rebuttal : 21 - 23 March 2016
Notification : 6 April 2016

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 and homotopy
type theory. The name of the new conference comes from an unpublished
but important book by Gerard Huet that strongly influenced many
researchers in the area.

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

1 Calculi
* Lambda calculus
* Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.)
* Rewriting systems (string, term, higher-order, graph, conditional,
modulo, infinitary, etc.)
* Proof theory (natural deduction, sequent calculus, proof nets, etc.)
* Type theory and logical frameworks
* Homotopy type theory

2. 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 (resolution, paramodulation, narrowing, focusing, etc.)
* Constraint solving and decision procedures

3. Semantics
* Operational semantics and abstract machines
* Game Semantics and applications
* Domain theory and categorical models
* Quantitative models (timing, probabilities, resources, etc.)
* Quantum computation and emerging models in computation

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 (proof assistants, automated
theorem prover, proof checkers, specialized provers, dependently
typed languages, etc.)
* Verification tools (abstract interpretation, termination,
confluence, specialized provers, etc.)
* Libraries for proof assistants and interactive theorem provers
(support for variable bindings, nominal, polynomial, equality, etc.)
* Case studies in proof assistants and interactive theorem provers
(formalizations, mechanizations, certifications)
* Certifications (theorems, rewriting techniques, etc.)
* Applications of formal systems inside and outside of CS (biology,
linguistics, physics, education, etc.)


To be announced

Delia Kesner (Univ. Paris-Diderot)
Brigitte Pientka (McGill University)

Andreas Abel (Gothenburg Univ.)
Zena Ariola (Univ. Oregon)
Patrick Baillot (CNRS & ENS Lyon)
Andrej Bauer (Univ. Ljubljana)
Eduardo Bonelli (Univ. Quilmes)
Patricia Bouyer (ENS Cachan)
Ugo Dal Lago (Univ. Bologna)
Nachum Dershowitz (Univ. Tel Aviv)
Mariangiola Dezani-Ciancaglini (Univ. Torino)
Derek Dreyer (MPI-SWS)
Santiago Figueira (Univ. Buenos Aires)
Marcelo Fiore (Univ. Cambridge)
Juergen Giesl (Univ. Aachen)
Nao Hirokawa (JAIST)
Martin Hofmann (LMU Munchen)
Delia Kesner (Univ. Paris-Diderot)
Naoki Kobayashi (Univ. Tokyo)
Dan Licata (Wesleyan Univ.)
Chris Lynch (Clarkson Univ.)
Narciso Marti-Oliet (Univ. Complutense)
Aart Middeldorp (Univ. Innsbruck)
Dale Miller (INRIA Saclay)
Cesar Munoz (NASA)
Vivek Nigam (Univ. Paraiba)
Brigitte Pientka (McGill Univ.)
Jakob Rehof (Univ. Dortmund)
Xavier Rival (ENS Paris)
Peter Selinger (Dalhousie Univ.)
Paula Severi (Univ. Leicester)
Jakob Grue Simonsen (Univ. Copenhagen)
Matthieu Sozeau (INRIA Rocquencourt)
Sophie Tison (Univ. Lille)
Femke van Raamsdonk (VU Univ. Amsterdam)
Nobuko Yoshida (Imperial College)

Sandra Alves (University of Porto)

Thorsten Altenkirch (Univ. Nottingham)
Gilles Dowek (INRIA)
Santiago Escobar (Univ. Politecnica de Valencia)
Maribel Fernandez (King's College London)
Masahito Hasegawa (Univ. Kyoto)
Hugo Herbelin (INRIA)
Nao Hirokawa (JAIST)
Luke Ong (Chair, Univ. Oxford)
Jens Palsberg (UCLA)
Kristoffer Rose (Two Sigma Investments)
Rene Thiemann (Univ. Innsbruck)
Pawel Urzyczyn (Univ. Warsaw)
Femke van Raamsdonk (VU Univ. Amsterdam)

The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs
proceedings are open access.

Submissions can be made in two categories: regular research papers and
system descriptions.

Submissions of research papers must present original research which is
unpublished and not submitted elsewhere. They must not exceed 15 pages
(including figures and bibliography). Submissions of research papers
will be judged on originality, significance, correctness, and readability.

Submission of system descriptions must describe a working system which
has not been published or submitted elsewhere. They must not exceed 10
pages and should contain a link to a working system. System
descriptions will be judged on originality, significance, usefulness,
and readability.

Proofs of theoretical results that do not fit within the page limit,
executables of systems, code of case studies, benchmarks used to
evaluate a given system, should be made available, via a reference to
a website or in an appendix of the paper. Reviewers will be encouraged
to consider this additional material, but are not obliged
to. Submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission.

Submissions must be formatted using the LIPIcs style files using the
instructions at

A condition of submission is that, if accepted, one of the authors
must attend the conference to give the presentation.

Papers should be submitted via easychair. The submission site is at


Sandra Alves (Univ. Porto)
Sabine Broda (Univ. Porto)
Jose Espirito-Santo (Univ. do Minho)
Mario Florido (Univ. Porto)
Nelma Moreira (Univ. Porto)
Luis Pinto (Univ. do Minho)
Rogerio Reis (Univ. Porto)
Ana Paula Tomas (Univ. Porto)
Pedro Vasconcelos (Univ. Porto)

Related Resources

FSCD 2017   FSCD 2017 : Second International Conference on Formal Structures for Computation and Deduction
SPURS 2017   Sound and Practical Unanticipated Reuse of Software - Special Issue of Journal of Software: Evolution and Process
ICANN 2017   International Conference on Artificial Neural Networks 2017
LSFA 2017   12th Workshop on Logical and Semantic Frameworks, with Applications
SEMAPRO 2017   The Eleventh International Conference on Advances in Semantic Processing
ICFEM 2017   19th International Conference on Formal Engineering Methods
GECCO 2017   Genetic and Evolutionary Computation Conference
SERecSys 2017   2nd ICDM Workshop on Semantics-Enabled Recommender Systems
WADS 2017   Workshop on Algorithms and Data Structures
SemDeep 2017   Second Workshop on Semantic Deep Learning