[logic-ml] FSCD 2020 - First CFP
Nao Hirokawa
hirokawa at jaist.ac.jp
Fri Oct 4 12:56:12 JST 2019
皆様
6月末にパリで行われます FSCD 2020 の論文募集案内をお送り致します。
ぜひ論文の投稿をご検討下さい。
廣川 (JAIST)
CALL FOR PAPERS
Fifth International Conference on
Formal Structures for Computation and Deduction (FSCD 2020)
June 29 -- July 5, 2020, Paris, France
http://fscd2020.org/
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions
will not be considered.
Abstract: February 6, 2020
Submission: February 9, 2020
Rebuttal: March 27-29, 2020
Notification: April 13, 2020
Final version: April 27, 2020
FSCD (http://fscdconference.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, models of computation,
semantics and verification in new challenging areas. The suggested,
but not exclusive, list of topics for submission is:
1. Calculi: Rewriting systems (string, term, higher-order, graph,
conditional, modulo, infinitary, etc.); Lambda calculus; Logics
(first-order, higher-order, equational, modal, linear, classical,
constructive, etc.); Proof theory (natural deduction, sequent
calculus, proof nets, etc.); Type theory and logical frameworks;
Homotopy type theory; Quantum calculi.
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 and theorem
proving; 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, 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;
Verification tools; Proof assistants and interactive theorem
provers; Applications in industry; Applications of formal systems
in other sciences.
6. Semantics and Verification in new challenging areas: Certification;
Security; Blockchain protocols; Data Bases; Deep learning and
machine learning algorithms; Planning.
PUBLICATION
-----------
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.
SPECIAL ISSUE
-------------
Authors of selected papers will be invited to submit an extended
version to a special issue of Logical Methods in Computer Science.
SUBMISSION GUIDELINES
---------------------
Submissions can be made in two categories. Regular research papers are
limited to 15 pages (including references, with the possibility to add
an annex for technical details, e.g. proofs) and must present original
research which is unpublished and not submitted elsewhere. System
descriptions are limited to 15 pages (including references) and must
present new software tools in which FSCD topics play an important
role, or significantly new versions of such tools. Complete
instructions on submitting a paper can be found on the conference web
site.
BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The program committee will select a paper in which at least one author
is a junior researcher, i.e. either a student or whose PhD award date
is less than three years from the first day of the meeting. Other
authors should declare to the PC Chair that at least 50% of
contribution is made by the junior researcher(s).
PROGRAM COMMITTEE CHAIR
-----------------------
Zena M. Ariola, University of Oregon
fscd2020 at easychair.org
PROGRAM COMMITTEE
-----------------
M. Alpuente, Technical Univ. of Valencia
S. Alves, University of Porto
A. Bauer, University of Ljubljana
M. P. Bonacina, Università degli studi di Verona
P-L. Curien, CNRS - Univ. of Paris Diderot
P. Dybjer, Chalmers Univ. of Technology
U. De’Liguoro, University of Torino
M. Fernandez, King’s College London
M. Gaboardi, Boston University
D. Ghica, University of Birmingham
S. Ghilezan, University of Novi Sad
J. Giesl, RWTH Aachen University
S. Guerrini, University of Paris 13
R. Harper, Carnegie Mellon University
M. Hasegawa, Kyoto University
N. Hirokawa, JAIST
P. Johann, Appalachian State University
O. Kammar, University of Edinburgh
D. Kesner, University of Paris Diderot
C. Kop, Radboud University
O. Laurent, ENS Lyon
D. Licata, Wesleyan University
A. Middeldorp, University of Innsbruck
J. Mitchell, Stanford University
K. Nakata, SAP Postdam
M. Pagani, University of Paris Diderot
E. Pimentel, Fed. Univ. Rio Grande do Norte Vrije
F. van Raamsdonk, University Amsterdam
G. Rosu, University of Illinois
A. Sabry, Indiana University
A. Stump, University of Iowa
P. Urzyczyn, University of Warsaw
T. Uustalu, Reykjavik University
S. Zdancewic, University of Pennsylvania
CONFERENCE CHAIR
----------------
Stefano Guerrini, University of Paris 13
WORKSHOP CHAIR
--------------
Giulio Manzonetto, University of Paris 13
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
J. Vicary, Oxford University
PUBLICITY CHAIR
---------------
S. Alves, University of Porto
FSCD STEERING COMMITTEE
-----------------------
S. Alves (University of Porto),
M. Ayala-Rincón (University of Brasilia)
C. Fuhs (Birkbeck, London University)
H. Geuvers (Radboud University)
D. Kesner (Chair, University of Paris Diderot )
H. Kirchner (Inria)
C. Kop (Radboud University)
D. Mazza (University of Paris 13)
D. Miller (Inria)
L. Ong (Oxford University)
J. Rehof (TU Dortmund)
S. Staton (Oxford University)
More information about the Logic-ml
mailing list