caml-list - the Caml user's mailing list
 help / Atom feed
* [Caml-list] FSCD 2020 - First CFP
@ 2019-10-03 11:53 Sandra Alves
  0 siblings, 0 replies; 1+ messages in thread
From: Sandra Alves @ 2019-10-03 11:53 UTC (permalink / raw)
  To: caml-list, coq-club

[-- Attachment #1: Type: text/plain, Size: 6579 bytes --]

(Apologies for multiple copies of this announcement. Please circulate.)

                    CALL FOR PAPERS
	     Fifth International Conference on
 Formal Structures for Computation and Deduction (FSCD 2020)
           June 29 – July 5, 2020, Paris, France

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 ( <> ) 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.

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.

Authors of selected papers will be invited to submit an extended version to a special issue of 
Logical Methods in Computer Science.

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.

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).

Zena M. Ariola,  University of Oregon <>

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

Stefano Guerrini,  University of Paris 13

Giulio Manzonetto,  University of Paris 13

J. Vicary,  Oxford University

S. Alves,  University of Porto

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)

[-- Attachment #2: Type: text/html, Size: 10878 bytes --]

^ permalink raw reply	[flat|nested] 1+ messages in thread

only message in thread, back to index

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2019-10-03 11:53 [Caml-list] FSCD 2020 - First CFP Sandra Alves

caml-list - the Caml user's mailing list

Archives are clonable: git clone --mirror

AGPL code for this site: git clone public-inbox