caml-list - the Caml user's mailing list
 help / color / Atom feed
* [Caml-list] FSCD 2020 - First CFP
@ 2019-10-03 11:51 Sandra Alves
  0 siblings, 0 replies; only message in thread
From: Sandra Alves @ 2019-10-03 11:51 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
	      	        http://fscd2020.org/ <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/ <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@easychair.org <mailto:fscd2020@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)

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

<html><head><meta http-equiv="Content-Type" content="text/html charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class=""><div class="">(Apologies for multiple copies of this announcement. Please circulate.)</div><div class="">------------</div><div class=""><br class=""></div><div class=""><div class="">&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; CALL FOR PAPERS</div><div class=""><span class="Apple-tab-span" style="white-space: pre;">	</span>&nbsp;&nbsp; &nbsp; Fifth International Conference on</div><div class="">&nbsp;Formal Structures for Computation and Deduction (FSCD 2020)</div><div class="">&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;June 29 – July 5, 2020, Paris, France</div><div class=""><span class="Apple-tab-span" style="white-space: pre;">	</span>&nbsp;&nbsp; &nbsp; &nbsp;<span class="Apple-tab-span" style="white-space: pre;">	</span>&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<a href="http://fscd2020.org/" class="">http://fscd2020.org/</a></div><div class=""><br class=""></div><div class="">IMPORTANT DATES</div><div class="">---------------</div><div class="">All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered.</div><div class="">&nbsp; &nbsp; &nbsp; &nbsp;Abstract: &nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<b class="">February 6, 2020</b></div><div class="">&nbsp; &nbsp; &nbsp; &nbsp;Submission: &nbsp; &nbsp;<b class="">February 9, 2020</b><span class="Apple-tab-span" style="white-space: pre;">	</span></div><div class="">&nbsp; &nbsp; &nbsp; &nbsp;Rebuttal: &nbsp; &nbsp; &nbsp; &nbsp; March 27-29, 2020</div><div class="">&nbsp; &nbsp; &nbsp; &nbsp;Notification: &nbsp; &nbsp; April 13, 2020</div><div class="">&nbsp; &nbsp; &nbsp; &nbsp;Final version: &nbsp;April 27, 2020</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">FSCD (<a href="http://fscdconference.org/" class="">http://fscdconference.org/</a>&nbsp;) covers all aspects of formal structures for&nbsp;</div><div class="">computation and deduction from theoretical foundations to applications.&nbsp;</div><div class="">Building on two communities, RTA (Rewriting Techniques and Applications) and</div><div class="">TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core&nbsp;</div><div class="">topics and broadens their scope to closely related areas in logics, models</div><div class="">of computation, semantics and verification in new challenging areas. The suggested,</div><div class="">but not exclusive, list of topics for submission is:</div><div class="">1. Calculi: Rewriting systems (string, term, higher-order, graph, conditional, modulo,</div><div class="">&nbsp; &nbsp; infinitary, etc.); Lambda calculus; Logics (first-order, higher-order, equational,</div><div class="">&nbsp; &nbsp; modal, linear, classical, constructive, etc.); Proof theory (natural deduction,</div><div class="">&nbsp; &nbsp; sequent calculus, proof nets, etc.); Type theory and logical frameworks; Homotopy&nbsp;</div><div class="">&nbsp; &nbsp; type theory; Quantum calculi.</div><div class="">2. Methods in Computation and Deduction: Type systems (polymorphism, dependent,&nbsp;</div><div class="">&nbsp; &nbsp; recursive, intersection, session, etc.); Induction, coinduction; Matching, unification,</div><div class="">&nbsp; &nbsp; completion, orderings; Strategies (normalization, completeness, etc.); Tree automata;&nbsp;</div><div class="">&nbsp; &nbsp; Model building and model checking; Proof search and theorem proving; Constraint</div><div class="">&nbsp; &nbsp; solving and decision procedures.</div><div class="">3. Semantics: Operational semantics and abstract machines; Game Semantics and&nbsp;</div><div class="">&nbsp; &nbsp; applications; Domain theory and categorical models; Quantitative models (timing,</div><div class="">&nbsp; &nbsp; probabilities, etc.); Quantum computation and emerging models in computation.</div><div class="">4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference&nbsp;</div><div class="">&nbsp; &nbsp; and type checking; Abstract Interpretation; Complexity analysis and implicit&nbsp;</div><div class="">&nbsp; &nbsp; computational complexity; Checking termination, confluence, derivational complexity</div><div class="">&nbsp; &nbsp; and related properties; Symbolic computation.</div><div class="">5. Tools and Applications: Programming and proof environments; Verification tools;&nbsp;</div><div class="">&nbsp; &nbsp; Proof assistants and interactive theorem provers; Applications in industry; Applications&nbsp;</div><div class="">&nbsp; &nbsp; of formal systems in other sciences.</div><div class="">6. Semantics and Verification in new challenging areas: Certification; Security; Blockchain</div><div class="">&nbsp; &nbsp; protocols; Data Bases; Deep learning and machine learning algorithms; Planning.</div><div class=""><br class=""></div><div class="">PUBLICATION</div><div class="">-----------</div><div class="">The proceedings will be published as an electronic volume in the Leibniz International&nbsp;</div><div class="">Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.&nbsp;</div><div class="">All LIPIcs proceedings are open access.</div><div class=""><br class=""></div><div class="">SPECIAL ISSUE</div><div class="">-------------</div><div class="">Authors of selected papers will be invited to submit an extended version to a special issue of&nbsp;</div><div class="">Logical Methods in Computer Science.</div><div class=""><br class=""></div><div class="">SUBMISSION GUIDELINES</div><div class="">---------------------</div><div class="">Submissions can be made in two categories. Regular research papers are limited to 15 pages&nbsp;</div><div class="">(including references, with the possibility to add an annex for technical details, e.g. proofs)&nbsp;</div><div class="">and must present original research which is unpublished and not submitted elsewhere.&nbsp;</div><div class="">System descriptions are limited to 15 pages (including references) and must present new software</div><div class="">tools in which FSCD topics play an important role, or significantly new versions of such tools.</div><div class="">Complete instructions on submitting a paper can be found on the conference web site.</div><div class=""><br class=""></div><div class="">BEST PAPER AWARD BY JUNIOR RESEARCHERS</div><div class="">--------------------------------------</div><div class="">The program committee will select a paper in which at least one author is a junior researcher, i.e.&nbsp;</div><div class="">either a student or whose PhD award date is less than three years from the first day of the</div><div class="">meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made&nbsp;</div><div class="">by the junior researcher(s).</div><div class=""><br class=""></div><div class="">PROGRAM COMMITTEE CHAIR</div><div class="">-----------------------</div><div class="">Zena M. Ariola, &nbsp;University of Oregon</div><div class="">&nbsp;<a href="mailto:fscd2020@easychair.org" class="">fscd2020@easychair.org</a></div><div class=""><br class=""></div><div class="">PROGRAM COMMITTEE</div><div class="">-----------------</div><div class="">M. Alpuente, &nbsp;Technical Univ. of Valencia&nbsp;</div><div class="">S. Alves, &nbsp;University of Porto</div><div class="">A. Bauer, &nbsp;University of Ljubljana&nbsp;</div><div class="">M. P. Bonacina, &nbsp;Università degli studi di Verona&nbsp;</div><div class="">P-L. Curien, &nbsp;CNRS - Univ. of Paris Diderot&nbsp;</div><div class="">P. Dybjer, &nbsp;Chalmers Univ. of Technology&nbsp;</div><div class="">U. De’Liguoro, &nbsp;University of Torino</div><div class="">M. Fernandez, &nbsp;King’s College London&nbsp;</div><div class="">M. Gaboardi, &nbsp;Boston University&nbsp;</div><div class="">D. Ghica, &nbsp;University of Birmingham&nbsp;</div><div class="">S. Ghilezan, &nbsp;University of Novi Sad&nbsp;</div><div class="">J. Giesl, &nbsp;RWTH Aachen University&nbsp;</div><div class="">S. Guerrini, &nbsp;University of Paris 13&nbsp;</div><div class="">R. Harper, &nbsp;Carnegie Mellon University&nbsp;</div><div class="">M. Hasegawa, &nbsp;Kyoto University</div><div class="">N. Hirokawa, &nbsp;JAIST</div><div class="">P. Johann, &nbsp;Appalachian State University&nbsp;</div><div class="">O. Kammar, &nbsp;University of Edinburgh&nbsp;</div><div class="">D. Kesner, &nbsp;University of Paris Diderot&nbsp;</div><div class="">C. Kop, &nbsp;Radboud University</div><div class="">O. Laurent, &nbsp;ENS Lyon</div><div class="">D. Licata, &nbsp;Wesleyan University</div><div class="">A. Middeldorp, &nbsp;University of Innsbruck</div><div class="">J. Mitchell, &nbsp;Stanford University</div><div class="">K. Nakata, &nbsp;SAP Postdam</div><div class="">M. Pagani, &nbsp;University of Paris Diderot</div><div class="">E. Pimentel, &nbsp;Fed. Univ. Rio Grande do Norte Vrije&nbsp;</div><div class="">F. van Raamsdonk, &nbsp;University Amsterdam&nbsp;</div><div class="">G. Rosu, &nbsp;University of Illinois</div><div class="">A. Sabry, &nbsp;Indiana University</div><div class="">A. Stump, &nbsp;University of Iowa</div><div class="">P. Urzyczyn, &nbsp;University of Warsaw</div><div class="">T. Uustalu, &nbsp;Reykjavik University</div><div class="">S. Zdancewic, &nbsp;University of Pennsylvania</div><div class=""><br class=""></div><div class="">CONFERENCE CHAIR</div><div class="">----------------</div><div class="">Stefano Guerrini, &nbsp;University of Paris 13</div><div class=""><br class=""></div><div class="">WORKSHOP CHAIR</div><div class="">--------------</div><div class="">Giulio Manzonetto, &nbsp;University of Paris 13</div><div class=""><br class=""></div><div class="">STEERING COMMITTEE WORKSHOP CHAIR</div><div class="">--------------------------------</div><div class="">J. Vicary, &nbsp;Oxford University</div><div class=""><br class=""></div><div class="">PUBLICITY CHAIR</div><div class="">---------------</div><div class="">S. Alves, &nbsp;University of Porto</div><div class=""><br class=""></div><div class="">FSCD STEERING COMMITTEE</div><div class="">-----------------------</div><div class="">S. Alves (University of Porto),</div><div class="">M. Ayala-Rincón (University of Brasilia)</div><div class="">C. Fuhs (Birkbeck, London University)</div><div class="">H. Geuvers (Radboud University)</div><div class="">D. Kesner (Chair, University of Paris Diderot )&nbsp;</div><div class="">H. Kirchner (Inria)</div><div class="">C. Kop (Radboud University)</div><div class="">D. Mazza (University of Paris 13)</div><div class="">D. Miller (Inria)</div><div class="">L. Ong (Oxford University)</div><div class="">J. Rehof (TU Dortmund)</div><div class="">S. Staton (Oxford University)</div></div></body></html>

^ permalink raw reply	[flat|nested] only message 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:51 [Caml-list] FSCD 2020 - First CFP Sandra Alves

caml-list - the Caml user's mailing list

Archives are clonable:
	git clone --mirror http://inbox.vuxu.org/caml-list
	git clone --mirror https://inbox.ocaml.org/caml-list

Example config snippet for mirrors

Newsgroup available over NNTP:
	nntp://inbox.vuxu.org/vuxu.archive.caml-list


AGPL code for this site: git clone https://public-inbox.org/public-inbox.git